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.r111-smll-174867015800008.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 FunctionPointer-PT-b002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b002-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748762115610

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 07:15:17] [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-01 07:15:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 07:15:18] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2025-06-01 07:15:18] [INFO ] Transformed 306 places.
[2025-06-01 07:15:18] [INFO ] Transformed 840 transitions.
[2025-06-01 07:15:18] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 574 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 84 places in 17 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:15:18] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2025-06-01 07:15:18] [INFO ] Computed 4 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 2, 1, +inf, +inf, 2, +inf, +inf, +inf, 2, +inf, +inf, 2]
RANDOM walk for 10001 steps (30 resets) in 77 ms. (128 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (46 resets) in 138 ms. (647 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 8, 8, 2, 10, 3, 12, 11, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:15:18] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2025-06-01 07:15:18] [INFO ] Invariant cache hit.
[2025-06-01 07:15:19] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 07:15:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-01 07:15:19] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-06-01 07:15:19] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-01 07:15:19] [INFO ] [Real]Added 65 Read/Feed constraints in 22 ms returned sat
[2025-06-01 07:15:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:20] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-06-01 07:15:20] [INFO ] [Nat]Added 65 Read/Feed constraints in 50 ms returned sat
[2025-06-01 07:15:20] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 30 ms to minimize.
[2025-06-01 07:15:20] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 4 ms to minimize.
[2025-06-01 07:15:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 663 ms
[2025-06-01 07:15:20] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 94 ms.
[2025-06-01 07:15:20] [INFO ] Added : 4 causal constraints over 2 iterations in 197 ms. Result :sat
Minimization took 118 ms.
[2025-06-01 07:15:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:15:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2025-06-01 07:15:21] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-06-01 07:15:21] [INFO ] [Real]Added 65 Read/Feed constraints in 24 ms returned sat
[2025-06-01 07:15:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:21] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-06-01 07:15:21] [INFO ] [Nat]Added 65 Read/Feed constraints in 21 ms returned sat
[2025-06-01 07:15:21] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 4 ms to minimize.
[2025-06-01 07:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2025-06-01 07:15:21] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 78 ms.
[2025-06-01 07:15:21] [INFO ] Added : 2 causal constraints over 1 iterations in 143 ms. Result :sat
Minimization took 106 ms.
[2025-06-01 07:15:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:22] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-06-01 07:15:22] [INFO ] [Real]Added 65 Read/Feed constraints in 13 ms returned sat
[2025-06-01 07:15:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:15:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:22] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-06-01 07:15:22] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:15:22] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 3 ms to minimize.
[2025-06-01 07:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2025-06-01 07:15:22] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 65 ms.
[2025-06-01 07:15:22] [INFO ] Added : 3 causal constraints over 1 iterations in 143 ms. Result :sat
Minimization took 102 ms.
[2025-06-01 07:15:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:23] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-06-01 07:15:23] [INFO ] [Real]Added 65 Read/Feed constraints in 13 ms returned sat
[2025-06-01 07:15:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:23] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-06-01 07:15:23] [INFO ] [Nat]Added 65 Read/Feed constraints in 12 ms returned sat
[2025-06-01 07:15:23] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2025-06-01 07:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-01 07:15:23] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 40 ms.
[2025-06-01 07:15:23] [INFO ] Added : 2 causal constraints over 1 iterations in 103 ms. Result :sat
Minimization took 108 ms.
[2025-06-01 07:15:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:15:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 07:15:24] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-01 07:15:24] [INFO ] [Real]Added 65 Read/Feed constraints in 16 ms returned sat
[2025-06-01 07:15:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:15:24] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-06-01 07:15:24] [INFO ] [Nat]Added 65 Read/Feed constraints in 18 ms returned sat
[2025-06-01 07:15:24] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 4 ms to minimize.
[2025-06-01 07:15:24] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 4 ms to minimize.
[2025-06-01 07:15:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2025-06-01 07:15:24] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 62 ms.
[2025-06-01 07:15:25] [INFO ] Added : 1 causal constraints over 1 iterations in 138 ms. Result :sat
Minimization took 110 ms.
[2025-06-01 07:15:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:15:25] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2025-06-01 07:15:25] [INFO ] [Real]Added 65 Read/Feed constraints in 14 ms returned sat
[2025-06-01 07:15:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:25] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-01 07:15:25] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2025-06-01 07:15:25] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 3 ms to minimize.
[2025-06-01 07:15:26] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 3 ms to minimize.
[2025-06-01 07:15:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2025-06-01 07:15:26] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 52 ms.
[2025-06-01 07:15:26] [INFO ] Added : 2 causal constraints over 1 iterations in 140 ms. Result :sat
Minimization took 170 ms.
[2025-06-01 07:15:26] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 07:15:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:26] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 07:15:26] [INFO ] [Real]Added 65 Read/Feed constraints in 39 ms returned sat
[2025-06-01 07:15:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 07:15:27] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-01 07:15:27] [INFO ] [Nat]Added 65 Read/Feed constraints in 33 ms returned sat
[2025-06-01 07:15:27] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 2 ms to minimize.
[2025-06-01 07:15:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2025-06-01 07:15:27] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 57 ms.
[2025-06-01 07:15:27] [INFO ] Added : 2 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 169 ms.
[2025-06-01 07:15:27] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 07:15:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:27] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 07:15:27] [INFO ] [Real]Added 65 Read/Feed constraints in 25 ms returned sat
[2025-06-01 07:15:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:28] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-06-01 07:15:28] [INFO ] [Nat]Added 65 Read/Feed constraints in 15 ms returned sat
[2025-06-01 07:15:28] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2025-06-01 07:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-01 07:15:28] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 33 ms.
[2025-06-01 07:15:28] [INFO ] Added : 2 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 108 ms.
[2025-06-01 07:15:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 07:15:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 07:15:28] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-06-01 07:15:28] [INFO ] [Real]Added 65 Read/Feed constraints in 15 ms returned sat
[2025-06-01 07:15:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 07:15:29] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-06-01 07:15:29] [INFO ] [Nat]Added 65 Read/Feed constraints in 19 ms returned sat
[2025-06-01 07:15:29] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 47 ms.
[2025-06-01 07:15:29] [INFO ] Added : 1 causal constraints over 1 iterations in 125 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 8, 8, 2, 10, 3, 12, 11, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 8, 8, 2, 10, 3, 12, 11, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 190 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.7 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 190 transition count 600
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 73 place count 166 transition count 448
Iterating global reduction 1 with 24 rules applied. Total rules applied 97 place count 166 transition count 448
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 123 place count 166 transition count 422
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 137 place count 152 transition count 394
Iterating global reduction 2 with 14 rules applied. Total rules applied 151 place count 152 transition count 394
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 155 place count 152 transition count 390
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 159 place count 148 transition count 382
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 148 transition count 382
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 144 transition count 366
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 144 transition count 366
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 141 transition count 360
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 141 transition count 360
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 139 transition count 352
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 139 transition count 352
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 137 transition count 344
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 137 transition count 344
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 187 place count 135 transition count 340
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 135 transition count 340
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 133 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 133 transition count 336
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 131 transition count 332
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 131 transition count 332
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 129 transition count 328
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 129 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 203 place count 127 transition count 324
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 127 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 217 place count 127 transition count 312
Applied a total of 217 rules in 294 ms. Remains 127 /222 variables (removed 95) and now considering 312/648 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 127/222 places, 312/648 transitions.
[2025-06-01 07:15:29] [INFO ] Flow matrix only has 203 transitions (discarded 109 similar events)
Found an invariant !
This invariant on transitions {27=1, 101=1, 157=1, 200=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {24=1, 98=1, 138=1, 190=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :[2147483647, 2147483647, 38, 0, 0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, 38, 2, 10, 3, +inf, 11, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:15:30] [INFO ] Flow matrix only has 203 transitions (discarded 109 similar events)
// Phase 1: matrix 203 rows 127 cols
[2025-06-01 07:15:30] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, 38, 2, 10, 3, +inf, 11, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2128 ms. (469 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6000004 steps (12 resets) in 3412 ms. (1757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[820, 1600, 1544, 11, 1828, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:15:35] [INFO ] Flow matrix only has 203 transitions (discarded 109 similar events)
[2025-06-01 07:15:35] [INFO ] Invariant cache hit.
[2025-06-01 07:15:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:35] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-01 07:15:35] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-01 07:15:35] [INFO ] [Real]Added 32 Read/Feed constraints in 12 ms returned sat
[2025-06-01 07:15:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:35] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-01 07:15:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:15:36] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 16 ms.
[2025-06-01 07:15:36] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2025-06-01 07:15:36] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2025-06-01 07:15:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2025-06-01 07:15:36] [INFO ] Added : 18 causal constraints over 5 iterations in 355 ms. Result :sat
Minimization took 80 ms.
[2025-06-01 07:15:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:36] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-01 07:15:36] [INFO ] [Real]Added 32 Read/Feed constraints in 12 ms returned sat
[2025-06-01 07:15:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:36] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 07:15:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:15:36] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2025-06-01 07:15:37] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2025-06-01 07:15:37] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2025-06-01 07:15:37] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2025-06-01 07:15:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2025-06-01 07:15:37] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 15 ms.
[2025-06-01 07:15:37] [INFO ] Added : 11 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 45 ms.
[2025-06-01 07:15:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:37] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-01 07:15:37] [INFO ] [Real]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 07:15:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:37] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 07:15:37] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2025-06-01 07:15:37] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2025-06-01 07:15:37] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2025-06-01 07:15:37] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2025-06-01 07:15:37] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2025-06-01 07:15:38] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2025-06-01 07:15:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 467 ms
[2025-06-01 07:15:38] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 16 ms.
[2025-06-01 07:15:38] [INFO ] Added : 2 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 43 ms.
[2025-06-01 07:15:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:38] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-01 07:15:38] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:38] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 07:15:38] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:15:38] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2025-06-01 07:15:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-01 07:15:38] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 23 ms.
[2025-06-01 07:15:38] [INFO ] Added : 5 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 64 ms.
[2025-06-01 07:15:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:38] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-01 07:15:38] [INFO ] [Real]Added 32 Read/Feed constraints in 17 ms returned sat
[2025-06-01 07:15:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:15:39] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-01 07:15:39] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:39] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 16 ms.
[2025-06-01 07:15:39] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2025-06-01 07:15:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-06-01 07:15:39] [INFO ] Added : 9 causal constraints over 5 iterations in 208 ms. Result :sat
Minimization took 45 ms.
[2025-06-01 07:15:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:39] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 07:15:39] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:39] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 07:15:39] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:39] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 16 ms.
[2025-06-01 07:15:39] [INFO ] Added : 15 causal constraints over 5 iterations in 99 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[820, 1600, 1544, 11, 1828, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19809, 1600, 1544, 11, 1828, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 312/312 transitions.
Graph (complete) has 529 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 123 transition count 306
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 123 transition count 306
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 123 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 122 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 122 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 121 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 121 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 120 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 120 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 119 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 119 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 118 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 276
Applied a total of 33 rules in 62 ms. Remains 112 /127 variables (removed 15) and now considering 276/312 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 112/127 places, 276/312 transitions.
[2025-06-01 07:15:52] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Found an invariant !
This invariant on transitions {25=1, 85=1, 138=1, 177=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 86=1, 139=1, 174=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :[2147483647, 2, 0, 3, 0, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 1600, 1544, 11, 1828, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:15:52] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
// Phase 1: matrix 178 rows 112 cols
[2025-06-01 07:15:52] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 1600, 1544, 11, 1828, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1406 ms. (710 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 5000005 steps (10 resets) in 2521 ms. (1982 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1600, 1544, 11, 1828, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:15:56] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 07:15:56] [INFO ] Invariant cache hit.
[2025-06-01 07:15:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:56] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 07:15:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 07:15:56] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:15:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:56] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 07:15:56] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:56] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 17 ms.
[2025-06-01 07:15:56] [INFO ] Added : 15 causal constraints over 4 iterations in 91 ms. Result :sat
Minimization took 48 ms.
[2025-06-01 07:15:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:56] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 07:15:56] [INFO ] [Real]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 07:15:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:56] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 07:15:56] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:15:56] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 14 ms.
[2025-06-01 07:15:57] [INFO ] Added : 29 causal constraints over 7 iterations in 132 ms. Result :sat
Minimization took 58 ms.
[2025-06-01 07:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:57] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 14 ms.
[2025-06-01 07:15:57] [INFO ] Added : 25 causal constraints over 6 iterations in 115 ms. Result :sat
Minimization took 51 ms.
[2025-06-01 07:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Real]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 07:15:57] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:15:57] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 07:15:57] [INFO ] Added : 24 causal constraints over 6 iterations in 131 ms. Result :sat
Minimization took 53 ms.
[2025-06-01 07:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:58] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 07:15:58] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:15:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:15:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:15:58] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-01 07:15:58] [INFO ] [Nat]Added 28 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:15:58] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2025-06-01 07:15:58] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2025-06-01 07:15:58] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2025-06-01 07:15:58] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2025-06-01 07:15:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 340 ms
[2025-06-01 07:15:58] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 07:15:58] [INFO ] Added : 7 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1600, 1544, 11, 1828, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1600, 1544, 11, 1828, 19] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Graph (complete) has 472 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 110 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 109 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 109 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 108 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 108 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 107 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 107 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 106 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 106 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 105 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 105 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 104 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 104 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 103 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 102 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 102 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 101 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 101 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 100 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 99 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 99 transition count 248
Applied a total of 25 rules in 56 ms. Remains 99 /112 variables (removed 13) and now considering 248/276 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 99/112 places, 248/276 transitions.
[2025-06-01 07:16:12] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
Found an invariant !
This invariant on transitions {30=1, 80=1, 130=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 81=1, 131=1, 153=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :[2, 3, 2147483647, 5, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1600, 1544, +inf, 1828, 19] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 07:16:12] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
// Phase 1: matrix 157 rows 99 cols
[2025-06-01 07:16:12] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1600, 1544, +inf, 1828, 19] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000004 steps (2 resets) in 1383 ms. (722 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000004 steps (8 resets) in 1942 ms. (2058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1650, 1544, 1828, 2398] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 07:16:15] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
[2025-06-01 07:16:15] [INFO ] Invariant cache hit.
[2025-06-01 07:16:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:15] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-01 07:16:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 07:16:15] [INFO ] [Real]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 07:16:15] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:15] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 12 ms.
[2025-06-01 07:16:15] [INFO ] Added : 15 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 39 ms.
[2025-06-01 07:16:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Real]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:16] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-01 07:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-01 07:16:16] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 16 ms.
[2025-06-01 07:16:16] [INFO ] Added : 5 causal constraints over 2 iterations in 52 ms. Result :sat
Minimization took 34 ms.
[2025-06-01 07:16:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:16] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 11 ms.
[2025-06-01 07:16:16] [INFO ] Added : 18 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 40 ms.
[2025-06-01 07:16:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-01 07:16:16] [INFO ] [Nat]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:16:16] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 13 ms.
[2025-06-01 07:16:16] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2025-06-01 07:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-01 07:16:17] [INFO ] Added : 6 causal constraints over 3 iterations in 148 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1650, 1544, 1828, 2398] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1650, 1544, 1828, 2398] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 248/248 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 97 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 96 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 96 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 95 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 95 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 94 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 94 transition count 234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 93 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 93 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 92 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 92 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 91 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 90 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 89 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 89 transition count 224
Applied a total of 20 rules in 51 ms. Remains 89 /99 variables (removed 10) and now considering 224/248 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 89/99 places, 224/248 transitions.
[2025-06-01 07:16:32] [INFO ] Flow matrix only has 139 transitions (discarded 85 similar events)
Found an invariant !
This invariant on transitions {27=1, 67=1, 98=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 71=1, 118=1, 137=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :[0, 2147483647, 2147483647, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1650, +inf, +inf, 2398] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 07:16:32] [INFO ] Flow matrix only has 139 transitions (discarded 85 similar events)
// Phase 1: matrix 139 rows 89 cols
[2025-06-01 07:16:32] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1650, +inf, +inf, 2398] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1518 ms. (658 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 930 ms. (2148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
[2025-06-01 07:16:35] [INFO ] Flow matrix only has 139 transitions (discarded 85 similar events)
[2025-06-01 07:16:35] [INFO ] Invariant cache hit.
[2025-06-01 07:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-06-01 07:16:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 07:16:35] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:16:35] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 07:16:35] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:35] [INFO ] Computed and/alt/rep : 62/243/57 causal constraints (skipped 80 transitions) in 10 ms.
[2025-06-01 07:16:35] [INFO ] Added : 14 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 07:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:16:35] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-01 07:16:35] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:16:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:35] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 07:16:35] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:16:35] [INFO ] Computed and/alt/rep : 62/243/57 causal constraints (skipped 80 transitions) in 11 ms.
[2025-06-01 07:16:35] [INFO ] Added : 5 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 224/224 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 87 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 86 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 85 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 84 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 83 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 82 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 82 transition count 208
Applied a total of 14 rules in 24 ms. Remains 82 /89 variables (removed 7) and now considering 208/224 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 82/89 places, 208/224 transitions.
[2025-06-01 07:16:35] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
Found an invariant !
This invariant on transitions {29=1, 63=1, 109=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 64=1, 94=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :[3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
[2025-06-01 07:16:35] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
// Phase 1: matrix 127 rows 82 cols
[2025-06-01 07:16:35] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1432 ms. (697 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 905 ms. (2207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
[2025-06-01 07:16:38] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:16:38] [INFO ] Invariant cache hit.
[2025-06-01 07:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:16:38] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-06-01 07:16:38] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:16:38] [INFO ] [Real]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:16:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 07:16:38] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:16:38] [INFO ] Computed and/alt/rep : 59/194/53 causal constraints (skipped 72 transitions) in 10 ms.
[2025-06-01 07:16:38] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 28 ms.
[2025-06-01 07:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:38] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-01 07:16:38] [INFO ] [Real]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 07:16:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:16:38] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-01 07:16:38] [INFO ] [Nat]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:16:38] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2025-06-01 07:16:38] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 3 ms to minimize.
[2025-06-01 07:16:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2025-06-01 07:16:38] [INFO ] Computed and/alt/rep : 59/194/53 causal constraints (skipped 72 transitions) in 17 ms.
[2025-06-01 07:16:38] [INFO ] Added : 7 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 07:16:45] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:16:45] [INFO ] Invariant cache hit.
[2025-06-01 07:16:45] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-01 07:16:45] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:16:45] [INFO ] Invariant cache hit.
[2025-06-01 07:16:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:16:45] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2025-06-01 07:16:45] [INFO ] Redundant transitions in 15 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 07:16:45] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:16:45] [INFO ] Invariant cache hit.
[2025-06-01 07:16:45] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 127/209 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 6868 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 127/209 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 7785 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 15126ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 15148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15480 ms. Remains : 82/82 places, 208/208 transitions.
[2025-06-01 07:17:00] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
Found an invariant !
This invariant on transitions {29=1, 63=1, 109=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 64=1, 94=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :[2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
RANDOM walk for 40004 steps (8 resets) in 987 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
[2025-06-01 07:17:01] [INFO ] Flatten gal took : 159 ms
[2025-06-01 07:17:01] [INFO ] Flatten gal took : 83 ms
[2025-06-01 07:17:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11287146199417604576.gal : 25 ms
[2025-06-01 07:17:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16830098389790790446.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/ReachabilityCardinality11287146199417604576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16830098389790790446.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/ReachabilityCardinality16830098389790790446.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 351
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :351 after 786
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :786 after 1323
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1323 after 10079
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10079 after 46999
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46999 after 120271
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :120271 after 266247
Interrupted probabilistic random walk after 374771 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 2
Probabilistic random walk after 374771 steps, saw 233295 distinct states, run finished after 3008 ms. (steps per millisecond=124 ) properties seen :0
[2025-06-01 07:17:04] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:17:04] [INFO ] Invariant cache hit.
[2025-06-01 07:17:04] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/96 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/101 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 92/193 variables, 53/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/199 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/208 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/209 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/96 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/101 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 92/193 variables, 53/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/199 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/199 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/208 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/209 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :266247 after 557631
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :557631 after 1.13983e+06
Parikh walk visited 0 properties in 26923 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 208/208 transitions.
RANDOM walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 537581 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 2
Probabilistic random walk after 537581 steps, saw 334637 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2025-06-01 07:17:34] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:17:34] [INFO ] Invariant cache hit.
[2025-06-01 07:17:34] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/96 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/101 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 92/193 variables, 53/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/199 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/208 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/209 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/96 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/101 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 92/193 variables, 53/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/199 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/199 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/208 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/209 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/209 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Detected timeout of ITS tools.
[2025-06-01 07:17:51] [INFO ] Flatten gal took : 47 ms
[2025-06-01 07:17:51] [INFO ] Applying decomposition
[2025-06-01 07:17:51] [INFO ] Flatten gal took : 49 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/graph12954679532897697081.txt' '-o' '/tmp/graph12954679532897697081.bin' '-w' '/tmp/graph12954679532897697081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12954679532897697081.bin' '-l' '-1' '-v' '-w' '/tmp/graph12954679532897697081.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:17:52] [INFO ] Decomposing Gal with order
[2025-06-01 07:17:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:17:53] [INFO ] Removed a total of 353 redundant transitions.
[2025-06-01 07:17:53] [INFO ] Flatten gal took : 393 ms
[2025-06-01 07:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 104 ms.
[2025-06-01 07:17:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16336651069454722524.gal : 36 ms
[2025-06-01 07:17:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11617024180655748178.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/ReachabilityCardinality16336651069454722524.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11617024180655748178.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11617024180655748178.prop.
Parikh walk visited 0 properties in 30000 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 07:18:05] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:18:05] [INFO ] Invariant cache hit.
[2025-06-01 07:18:05] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-01 07:18:05] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:18:05] [INFO ] Invariant cache hit.
[2025-06-01 07:18:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:18:05] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2025-06-01 07:18:05] [INFO ] Redundant transitions in 20 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 07:18:05] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:18:05] [INFO ] Invariant cache hit.
[2025-06-01 07:18:05] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 127/209 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 4758 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 127/209 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5802 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 10756ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 10761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11192 ms. Remains : 82/82 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 82 transition count 120
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 75 transition count 120
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 95 place count 75 transition count 105
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 125 place count 60 transition count 105
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 155 place count 45 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 38 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 38 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 31 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 31 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 24 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 24 transition count 48
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 204 place count 24 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 204 place count 24 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 22 transition count 39
Applied a total of 209 rules in 28 ms. Remains 22 /82 variables (removed 60) and now considering 39/208 (removed 169) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 22 cols
[2025-06-01 07:18:16] [INFO ] Computed 3 invariants in 0 ms
[2025-06-01 07:18:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 07:18:16] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2025-06-01 07:18:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 07:18:16] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-01 07:18:16] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-01 07:18:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 07:18:16] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-01 07:18:16] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-01 07:18:16] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-01 07:18:16] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-01 07:18:16] [INFO ] Flatten gal took : 4 ms
[2025-06-01 07:18:16] [INFO ] Flatten gal took : 3 ms
[2025-06-01 07:18:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality492932241036467122.gal : 2 ms
[2025-06-01 07:18:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2067963206641110329.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/ReachabilityCardinality492932241036467122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2067963206641110329.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 ...327
Loading property file /tmp/ReachabilityCardinality2067963206641110329.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 88
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :88 after 312
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :312 after 1180
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1180 after 4512
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4512 after 17448
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :17448 after 68144
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :68144 after 268348
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :268348 after 1.06298e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.06298e+06 after 4.22716e+06
Detected timeout of ITS tools.
[2025-06-01 07:18:31] [INFO ] Flatten gal took : 3 ms
[2025-06-01 07:18:31] [INFO ] Applying decomposition
[2025-06-01 07:18:31] [INFO ] Flatten gal took : 3 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/graph18066073510349164335.txt' '-o' '/tmp/graph18066073510349164335.bin' '-w' '/tmp/graph18066073510349164335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18066073510349164335.bin' '-l' '-1' '-v' '-w' '/tmp/graph18066073510349164335.weights' '-q' '0' '-e' '0.001'
[2025-06-01 07:18:31] [INFO ] Decomposing Gal with order
[2025-06-01 07:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 07:18:31] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 07:18:31] [INFO ] Flatten gal took : 6 ms
[2025-06-01 07:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2025-06-01 07:18:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2428402609441200275.gal : 2 ms
[2025-06-01 07:18:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18328350389746264810.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/ReachabilityCardinality2428402609441200275.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18328350389746264810.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality18328350389746264810.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 73
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :73 after 89
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :89 after 141
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :141 after 249
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :249 after 457
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :457 after 873
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :873 after 1705
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1705 after 3353
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3353 after 6633
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6633 after 13193
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30371 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1650, 2398] Max Struct:[+inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-05
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:18:46] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
// Phase 1: matrix 127 rows 82 cols
[2025-06-01 07:18:46] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17] Max Struct:[+inf]
[2025-06-01 07:18:46] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:18:46] [INFO ] Invariant cache hit.
[2025-06-01 07:18:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:18:46] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-01 07:18:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:18:46] [INFO ] [Real]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:18:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:18:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:18:46] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-01 07:18:46] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:18:46] [INFO ] Computed and/alt/rep : 59/194/53 causal constraints (skipped 72 transitions) in 14 ms.
[2025-06-01 07:18:47] [INFO ] Added : 11 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 204
Applied a total of 4 rules in 12 ms. Remains 81 /82 variables (removed 1) and now considering 204/208 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 81/82 places, 204/208 transitions.
[2025-06-01 07:18:47] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[19] Max Struct:[+inf]
[2025-06-01 07:18:47] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2025-06-01 07:18:47] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1186 ms. (842 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 477 ms. (2092 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[+inf]
[2025-06-01 07:18:48] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:18:48] [INFO ] Invariant cache hit.
[2025-06-01 07:18:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:18:49] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 07:18:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:18:49] [INFO ] [Real]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:18:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:18:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:18:49] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 07:18:49] [INFO ] [Nat]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:18:49] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
[2025-06-01 07:18:49] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
[2025-06-01 07:18:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2025-06-01 07:18:49] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 16 ms.
[2025-06-01 07:18:49] [INFO ] Added : 19 causal constraints over 6 iterations in 125 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[40] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:18:49] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:18:49] [INFO ] Invariant cache hit.
[2025-06-01 07:18:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-01 07:18:49] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:18:49] [INFO ] Invariant cache hit.
[2025-06-01 07:18:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:18:50] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2025-06-01 07:18:50] [INFO ] Redundant transitions in 4 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:18:50] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:18:50] [INFO ] Invariant cache hit.
[2025-06-01 07:18:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7482 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 14991ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 14997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15481 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:19:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[40] Max Struct:[+inf]
[2025-06-01 07:19:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[40] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1600 ms. (624 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 463 ms. (2155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1577] Max Struct:[+inf]
[2025-06-01 07:19:07] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:07] [INFO ] Invariant cache hit.
[2025-06-01 07:19:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:19:07] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 07:19:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:19:07] [INFO ] [Real]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:19:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:19:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:19:07] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 07:19:07] [INFO ] [Nat]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 07:19:07] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2025-06-01 07:19:07] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 20 ms to minimize.
[2025-06-01 07:19:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2025-06-01 07:19:07] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 14 ms.
[2025-06-01 07:19:08] [INFO ] Added : 19 causal constraints over 6 iterations in 120 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1577] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1577] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 15 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:19:12] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:12] [INFO ] Invariant cache hit.
[2025-06-01 07:19:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-01 07:19:12] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:12] [INFO ] Invariant cache hit.
[2025-06-01 07:19:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:19:12] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2025-06-01 07:19:12] [INFO ] Redundant transitions in 3 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:19:12] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:12] [INFO ] Invariant cache hit.
[2025-06-01 07:19:12] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6094 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 8723 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 15049ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 15054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15368 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:19:27] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1577] Max Struct:[+inf]
[2025-06-01 07:19:27] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1577] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1546 ms. (646 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 599 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6534] Max Struct:[+inf]
[2025-06-01 07:19:29] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:29] [INFO ] Invariant cache hit.
[2025-06-01 07:19:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:19:29] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-01 07:19:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:19:29] [INFO ] [Real]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 07:19:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:19:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 07:19:30] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 07:19:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 11 ms returned sat
[2025-06-01 07:19:30] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
[2025-06-01 07:19:30] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2025-06-01 07:19:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2025-06-01 07:19:30] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 16 ms.
[2025-06-01 07:19:30] [INFO ] Added : 19 causal constraints over 6 iterations in 126 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6534] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6534] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:19:43] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:43] [INFO ] Invariant cache hit.
[2025-06-01 07:19:43] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-01 07:19:43] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:43] [INFO ] Invariant cache hit.
[2025-06-01 07:19:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:19:43] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2025-06-01 07:19:43] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:19:43] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:43] [INFO ] Invariant cache hit.
[2025-06-01 07:19:43] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 4985 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7540 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 12693ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 12695ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13009 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:19:56] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[6534] Max Struct:[+inf]
[2025-06-01 07:19:56] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6534] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1380 ms. (724 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6534] Max Struct:[+inf]
[2025-06-01 07:19:58] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:19:58] [INFO ] Invariant cache hit.
[2025-06-01 07:19:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:19:58] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-01 07:19:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:19:58] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:19:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:19:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:19:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-06-01 07:19:58] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:19:58] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-06-01 07:19:58] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-06-01 07:19:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2025-06-01 07:19:58] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 10 ms.
[2025-06-01 07:19:58] [INFO ] Added : 19 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6534] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6534] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-01 07:20:13] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:20:13] [INFO ] Invariant cache hit.
[2025-06-01 07:20:14] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-01 07:20:14] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:20:14] [INFO ] Invariant cache hit.
[2025-06-01 07:20:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:20:14] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2025-06-01 07:20:14] [INFO ] Redundant transitions in 2 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-01 07:20:14] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:20:14] [INFO ] Invariant cache hit.
[2025-06-01 07:20:14] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7140 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 9370 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 16672ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 16676ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17163 ms. Remains : 81/81 places, 204/204 transitions.
[2025-06-01 07:20:31] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-06-01 07:20:31] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2025-06-01 07:20:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1445 ms. (691 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 07:20:32] [INFO ] Flatten gal took : 16 ms
[2025-06-01 07:20:32] [INFO ] Flatten gal took : 14 ms
[2025-06-01 07:20:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9225114435172406932.gal : 3 ms
[2025-06-01 07:20:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10749923365131547338.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/ReachabilityCardinality9225114435172406932.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10749923365131547338.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-05 in 106000 ms.
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-14
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 07:20:32] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
// Phase 1: matrix 127 rows 82 cols
[2025-06-01 07:20:32] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[186] Max Struct:[+inf]
[2025-06-01 07:20:32] [INFO ] Flow matrix only has 127 transitions (discarded 81 similar events)
[2025-06-01 07:20:32] [INFO ] Invariant cache hit.
[2025-06-01 07:20:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:20:32] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-06-01 07:20:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 07:20:32] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 07:20:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:20:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:20:32] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-01 07:20:32] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:20:33] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2025-06-01 07:20:33] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2025-06-01 07:20:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2025-06-01 07:20:33] [INFO ] Computed and/alt/rep : 59/194/53 causal constraints (skipped 72 transitions) in 15 ms.
[2025-06-01 07:20:33] [INFO ] Added : 7 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[186] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[186] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 80 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 80 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 79 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 79 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 78 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 78 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 77 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 77 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 76 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 75 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 75 transition count 192
Applied a total of 14 rules in 22 ms. Remains 75 /82 variables (removed 7) and now considering 192/208 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 75/82 places, 192/208 transitions.
[2025-06-01 07:20:33] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[186] Max Struct:[+inf]
[2025-06-01 07:20:33] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2025-06-01 07:20:33] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[186] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1425 ms. (701 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 502 ms. (1988 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[186] Max Struct:[+inf]
[2025-06-01 07:20:35] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:20:35] [INFO ] Invariant cache hit.
[2025-06-01 07:20:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 07:20:35] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-06-01 07:20:35] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:20:35] [INFO ] [Real]Added 17 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:20:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 07:20:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 07:20:35] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-01 07:20:35] [INFO ] [Nat]Added 17 Read/Feed constraints in 4 ms returned sat
[2025-06-01 07:20:35] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 10 ms.
[2025-06-01 07:20:35] [INFO ] Added : 7 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[186] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[186] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 07:20:36] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:20:36] [INFO ] Invariant cache hit.
[2025-06-01 07:20:36] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-01 07:20:36] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:20:36] [INFO ] Invariant cache hit.
[2025-06-01 07:20:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 07:20:36] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2025-06-01 07:20:36] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 07:20:36] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:20:36] [INFO ] Invariant cache hit.
[2025-06-01 07:20:36] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5304 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6576 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 12100ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 12105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12547 ms. Remains : 75/75 places, 192/192 transitions.
[2025-06-01 07:20:48] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-06-01 07:20:48] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2025-06-01 07:20:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 1331 ms. (750 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 07:20:50] [INFO ] Flatten gal took : 14 ms
[2025-06-01 07:20:50] [INFO ] Flatten gal took : 12 ms
[2025-06-01 07:20:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13841916170710516641.gal : 3 ms
[2025-06-01 07:20:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11071438629573209720.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/ReachabilityCardinality13841916170710516641.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11071438629573209720.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-14 in 17418 ms.
[2025-06-01 07:20:50] [INFO ] Flatten gal took : 13 ms
Total runtime 332423 ms.

BK_STOP 1748762450240

--------------------
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="FunctionPointer-PT-b002"
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 FunctionPointer-PT-b002, 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 r111-smll-174867015800008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b002.tgz
mv FunctionPointer-PT-b002 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 ;