About the Execution of 2024-gold for DoubleLock-PT-p2s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15690.450 | 3600000.00 | 4196610.00 | 10355.50 | 0 ? 1 ? 1 0 0 ? 1 ? 1 1 1 ? 1 10 | normal |
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.r083-tall-174860079700070.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 DoubleLock-PT-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 813K 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 DoubleLock-PT-p2s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748732995211
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:09:56] [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-05-31 23:09:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:09:56] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-05-31 23:09:56] [INFO ] Transformed 184 places.
[2025-05-31 23:09:56] [INFO ] Transformed 1832 transitions.
[2025-05-31 23:09:56] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 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] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 23:09:56] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2025-05-31 23:09:56] [INFO ] Computed 4 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, +inf, 1, 1, 1, +inf, 1, 10]
RANDOM walk for 10002 steps (98 resets) in 40 ms. (243 steps per ms)
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (94 resets) in 67 ms. (735 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-31 23:09:56] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2025-05-31 23:09:56] [INFO ] Invariant cache hit.
[2025-05-31 23:09:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 23:09:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2025-05-31 23:09:57] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2025-05-31 23:09:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:09:57] [INFO ] [Real]Added 116 Read/Feed constraints in 56 ms returned sat
[2025-05-31 23:09:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:09:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:09:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:09:57] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-05-31 23:09:57] [INFO ] [Nat]Added 116 Read/Feed constraints in 138 ms returned sat
[2025-05-31 23:09:58] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 166 ms.
[2025-05-31 23:09:58] [INFO ] Added : 2 causal constraints over 2 iterations in 364 ms. Result :sat
Minimization took 793 ms.
[2025-05-31 23:09:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:09:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:09:59] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2025-05-31 23:09:59] [INFO ] [Real]Added 116 Read/Feed constraints in 67 ms returned sat
[2025-05-31 23:09:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:09:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:09:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:09:59] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-31 23:09:59] [INFO ] [Nat]Added 116 Read/Feed constraints in 126 ms returned sat
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 13 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 2 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 2 ms to minimize.
[2025-05-31 23:10:00] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 2 ms to minimize.
[2025-05-31 23:10:01] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 1 ms to minimize.
[2025-05-31 23:10:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1118 ms
[2025-05-31 23:10:01] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 110 ms.
[2025-05-31 23:10:01] [INFO ] Added : 0 causal constraints over 0 iterations in 213 ms. Result :sat
Minimization took 780 ms.
[2025-05-31 23:10:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:10:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:10:02] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-31 23:10:02] [INFO ] [Real]Added 116 Read/Feed constraints in 40 ms returned sat
[2025-05-31 23:10:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:10:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-31 23:10:02] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-05-31 23:10:02] [INFO ] [Nat]Added 116 Read/Feed constraints in 172 ms returned sat
[2025-05-31 23:10:02] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 92 ms.
[2025-05-31 23:10:03] [INFO ] Added : 3 causal constraints over 2 iterations in 249 ms. Result :sat
Minimization took 600 ms.
[2025-05-31 23:10:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:10:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:10:03] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-31 23:10:03] [INFO ] [Real]Added 116 Read/Feed constraints in 38 ms returned sat
[2025-05-31 23:10:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:10:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:10:04] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-31 23:10:04] [INFO ] [Nat]Added 116 Read/Feed constraints in 158 ms returned sat
[2025-05-31 23:10:04] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 1 ms to minimize.
[2025-05-31 23:10:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2025-05-31 23:10:04] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 82 ms.
[2025-05-31 23:10:04] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 772 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 144 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 143 transition count 1720
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 143 transition count 1720
Applied a total of 19 rules in 100 ms. Remains 143 /148 variables (removed 5) and now considering 1720/1768 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 143/148 places, 1720/1768 transitions.
[2025-05-31 23:10:05] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 161 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :[1, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-31 23:10:06] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2025-05-31 23:10:06] [INFO ] Computed 2 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (10175 resets) in 1360 ms. (734 steps per ms)
BEST_FIRST walk for 4000003 steps (7787 resets) in 1968 ms. (2031 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-31 23:10:09] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-05-31 23:10:09] [INFO ] Invariant cache hit.
[2025-05-31 23:10:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:10:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:10:09] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-05-31 23:10:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:10:09] [INFO ] [Real]Added 116 Read/Feed constraints in 80 ms returned sat
[2025-05-31 23:10:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:10:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:10:10] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-31 23:10:10] [INFO ] [Nat]Added 116 Read/Feed constraints in 256 ms returned sat
[2025-05-31 23:10:10] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 72 ms.
[2025-05-31 23:10:10] [INFO ] Added : 1 causal constraints over 1 iterations in 233 ms. Result :sat
Minimization took 1109 ms.
[2025-05-31 23:10:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:10:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:10:11] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-31 23:10:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:10:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:10:12] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2025-05-31 23:10:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 181 ms returned sat
[2025-05-31 23:10:12] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 74 ms.
[2025-05-31 23:10:12] [INFO ] Added : 0 causal constraints over 0 iterations in 144 ms. Result :sat
Minimization took 1596 ms.
[2025-05-31 23:10:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:10:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:10:14] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-31 23:10:14] [INFO ] [Real]Added 116 Read/Feed constraints in 83 ms returned sat
[2025-05-31 23:10:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:10:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-31 23:10:14] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2025-05-31 23:10:15] [INFO ] [Nat]Added 116 Read/Feed constraints in 490 ms returned sat
[2025-05-31 23:10:15] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 74 ms.
[2025-05-31 23:10:15] [INFO ] Added : 2 causal constraints over 1 iterations in 187 ms. Result :sat
Minimization took 1310 ms.
[2025-05-31 23:10:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:10:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:10:16] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-05-31 23:10:16] [INFO ] [Real]Added 116 Read/Feed constraints in 67 ms returned sat
[2025-05-31 23:10:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:10:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:10:17] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:10:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 190 ms returned sat
[2025-05-31 23:10:17] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 71 ms.
[2025-05-31 23:10:17] [INFO ] Added : 0 causal constraints over 0 iterations in 139 ms. Result :sat
Minimization took 1337 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 36 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 31 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-05-31 23:10:19] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-05-31 23:10:19] [INFO ] Invariant cache hit.
[2025-05-31 23:10:19] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-05-31 23:10:19] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-05-31 23:10:19] [INFO ] Invariant cache hit.
[2025-05-31 23:10:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:10:20] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2025-05-31 23:10:20] [INFO ] Redundant transitions in 82 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-05-31 23:10:20] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-05-31 23:10:20] [INFO ] Invariant cache hit.
[2025-05-31 23:10:20] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 261 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 1718/1979 constraints. Problems are: Problem set: 115 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 1979 constraints, problems are : Problem set: 115 solved, 1603 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
After SMT, in 62719ms problems are : Problem set: 115 solved, 1603 unsolved
Search for dead transitions found 115 dead transitions in 62752ms
Found 115 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 115 transitions
Dead transitions reduction (with SMT) removed 115 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1605/1720 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
[2025-05-31 23:11:23] [INFO ] Redundant transitions in 79 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64082 ms. Remains : 143/143 places, 1605/1720 transitions.
[2025-05-31 23:11:23] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 699=1, 700=1, 1033=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 714=1, 715=1, 1050=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 151 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :[1, 1, 2, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-31 23:11:24] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
// Phase 1: matrix 1084 rows 143 cols
[2025-05-31 23:11:24] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (10214 resets) in 1138 ms. (877 steps per ms)
BEST_FIRST walk for 4000004 steps (7766 resets) in 2095 ms. (1908 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-31 23:11:27] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:11:27] [INFO ] Invariant cache hit.
[2025-05-31 23:11:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:27] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:11:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:11:27] [INFO ] [Real]Added 116 Read/Feed constraints in 67 ms returned sat
[2025-05-31 23:11:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:27] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-05-31 23:11:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 231 ms returned sat
[2025-05-31 23:11:28] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 69 ms.
[2025-05-31 23:11:28] [INFO ] Added : 0 causal constraints over 0 iterations in 133 ms. Result :sat
Minimization took 979 ms.
[2025-05-31 23:11:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:29] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-05-31 23:11:29] [INFO ] [Real]Added 116 Read/Feed constraints in 53 ms returned sat
[2025-05-31 23:11:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:11:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:29] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2025-05-31 23:11:30] [INFO ] [Nat]Added 116 Read/Feed constraints in 157 ms returned sat
[2025-05-31 23:11:30] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 69 ms.
[2025-05-31 23:11:30] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 1327 ms.
[2025-05-31 23:11:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:31] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-31 23:11:31] [INFO ] [Real]Added 116 Read/Feed constraints in 76 ms returned sat
[2025-05-31 23:11:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:11:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:11:32] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-05-31 23:11:32] [INFO ] [Nat]Added 116 Read/Feed constraints in 178 ms returned sat
[2025-05-31 23:11:32] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 68 ms.
[2025-05-31 23:11:32] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 1523 ms.
[2025-05-31 23:11:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:11:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Real]Added 116 Read/Feed constraints in 47 ms returned sat
[2025-05-31 23:11:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-05-31 23:11:34] [INFO ] [Nat]Added 116 Read/Feed constraints in 235 ms returned sat
[2025-05-31 23:11:34] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 67 ms.
[2025-05-31 23:11:34] [INFO ] Added : 0 causal constraints over 0 iterations in 135 ms. Result :sat
Minimization took 782 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 34 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 143/143 places, 1605/1605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
[2025-05-31 23:11:35] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:11:35] [INFO ] Invariant cache hit.
[2025-05-31 23:11:35] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-31 23:11:35] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:11:35] [INFO ] Invariant cache hit.
[2025-05-31 23:11:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:11:36] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2025-05-31 23:11:36] [INFO ] Redundant transitions in 30 ms returned []
Running 1603 sub problems to find dead transitions.
[2025-05-31 23:11:36] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:11:36] [INFO ] Invariant cache hit.
[2025-05-31 23:11:36] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 1603/1864 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 1864 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
After SMT, in 62017ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 62031ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63068 ms. Remains : 143/143 places, 1605/1605 transitions.
[2025-05-31 23:12:38] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 699=1, 700=1, 1033=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 714=1, 715=1, 1050=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 155 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :[1, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-31 23:12:39] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:12:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (10229 resets) in 1155 ms. (865 steps per ms)
BEST_FIRST walk for 4000003 steps (7749 resets) in 2000 ms. (1999 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
[2025-05-31 23:12:42] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:12:42] [INFO ] Invariant cache hit.
[2025-05-31 23:12:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:12:42] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:12:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:12:42] [INFO ] [Real]Added 116 Read/Feed constraints in 64 ms returned sat
[2025-05-31 23:12:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:12:42] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:12:43] [INFO ] [Nat]Added 116 Read/Feed constraints in 228 ms returned sat
[2025-05-31 23:12:43] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 79 ms.
[2025-05-31 23:12:43] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Minimization took 972 ms.
[2025-05-31 23:12:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:12:44] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-05-31 23:12:44] [INFO ] [Real]Added 116 Read/Feed constraints in 53 ms returned sat
[2025-05-31 23:12:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:12:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:12:44] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2025-05-31 23:12:45] [INFO ] [Nat]Added 116 Read/Feed constraints in 153 ms returned sat
[2025-05-31 23:12:45] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 75 ms.
[2025-05-31 23:12:45] [INFO ] Added : 0 causal constraints over 0 iterations in 142 ms. Result :sat
Minimization took 1336 ms.
[2025-05-31 23:12:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:12:46] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-05-31 23:12:46] [INFO ] [Real]Added 116 Read/Feed constraints in 73 ms returned sat
[2025-05-31 23:12:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:12:47] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-05-31 23:12:47] [INFO ] [Nat]Added 116 Read/Feed constraints in 186 ms returned sat
[2025-05-31 23:12:47] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 78 ms.
[2025-05-31 23:12:47] [INFO ] Added : 1 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 1538 ms.
[2025-05-31 23:12:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:12:49] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-31 23:12:49] [INFO ] [Real]Added 116 Read/Feed constraints in 54 ms returned sat
[2025-05-31 23:12:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:12:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:12:49] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-05-31 23:12:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 235 ms returned sat
[2025-05-31 23:12:49] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 75 ms.
[2025-05-31 23:12:49] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Minimization took 788 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1605/1605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
[2025-05-31 23:12:50] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:12:50] [INFO ] Invariant cache hit.
[2025-05-31 23:12:51] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-31 23:12:51] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:12:51] [INFO ] Invariant cache hit.
[2025-05-31 23:12:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:12:51] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2025-05-31 23:12:51] [INFO ] Redundant transitions in 21 ms returned []
Running 1603 sub problems to find dead transitions.
[2025-05-31 23:12:51] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:12:51] [INFO ] Invariant cache hit.
[2025-05-31 23:12:51] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 1603/1864 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 1864 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
After SMT, in 61961ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 61976ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62936 ms. Remains : 143/143 places, 1605/1605 transitions.
[2025-05-31 23:13:53] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 699=1, 700=1, 1033=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 714=1, 715=1, 1050=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 164 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :[1, 1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 40008 steps (410 resets) in 819 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (71 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (73 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (77 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
[2025-05-31 23:13:54] [INFO ] Flatten gal took : 248 ms
[2025-05-31 23:13:55] [INFO ] Flatten gal took : 116 ms
[2025-05-31 23:13:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7791637165757129523.gal : 56 ms
[2025-05-31 23:13:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12944345490056836644.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/ReachabilityCardinality7791637165757129523.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12944345490056836644.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12944345490056836644.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2693 after 19667
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :19667 after 77151
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :77151 after 238763
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :238763 after 1.04206e+07
Interrupted probabilistic random walk after 230313 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 230313 steps, saw 158939 distinct states, run finished after 3006 ms. (steps per millisecond=76 ) properties seen :0
[2025-05-31 23:13:57] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:13:57] [INFO ] Invariant cache hit.
[2025-05-31 23:13:57] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 942/1140 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1140 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 14/1154 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1154 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1154 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 73/1227 variables, 66/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 77/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.04206e+07 after 3.91574e+07
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 942/1140 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1140 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1140 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 14/1154 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1154 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1154 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 73/1227 variables, 66/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 77/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1227 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1227 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1631ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 143/143 places, 1605/1605 transitions.
RANDOM walk for 40007 steps (398 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (78 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (75 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (81 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 215564 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 4
Probabilistic random walk after 215564 steps, saw 149070 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2025-05-31 23:14:02] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:14:02] [INFO ] Invariant cache hit.
[2025-05-31 23:14:02] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 942/1140 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1140 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 14/1154 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1154 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1154 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 73/1227 variables, 66/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 77/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 194/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 942/1140 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1140 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1140 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 14/1154 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1154 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1154 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 73/1227 variables, 66/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 77/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1227 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1227 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1597ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 38 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 143/143 places, 1605/1605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
[2025-05-31 23:14:04] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:14:04] [INFO ] Invariant cache hit.
[2025-05-31 23:14:04] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-31 23:14:04] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:14:04] [INFO ] Invariant cache hit.
[2025-05-31 23:14:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:14:05] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2025-05-31 23:14:05] [INFO ] Redundant transitions in 24 ms returned []
Running 1603 sub problems to find dead transitions.
[2025-05-31 23:14:05] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:14:05] [INFO ] Invariant cache hit.
[2025-05-31 23:14:05] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.91574e+07 after 9.6564e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:14:45] [INFO ] Flatten gal took : 87 ms
[2025-05-31 23:14:45] [INFO ] Applying decomposition
[2025-05-31 23:14:45] [INFO ] Flatten gal took : 58 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/graph7421680221354416401.txt' '-o' '/tmp/graph7421680221354416401.bin' '-w' '/tmp/graph7421680221354416401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7421680221354416401.bin' '-l' '-1' '-v' '-w' '/tmp/graph7421680221354416401.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:14:45] [INFO ] Decomposing Gal with order
[2025-05-31 23:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:14:45] [INFO ] Removed a total of 3727 redundant transitions.
[2025-05-31 23:14:46] [INFO ] Flatten gal took : 188 ms
[2025-05-31 23:14:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 63 ms.
[2025-05-31 23:14:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12947621565622201366.gal : 29 ms
[2025-05-31 23:14:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3075680273111790305.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/ReachabilityCardinality12947621565622201366.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3075680273111790305.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/ReachabilityCardinality3075680273111790305.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 1603/1864 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 1864 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
After SMT, in 62321ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 62340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63239 ms. Remains : 143/143 places, 1605/1605 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 521 transitions
Reduce isomorphic transitions removed 521 transitions.
Iterating post reduction 0 with 521 rules applied. Total rules applied 521 place count 143 transition count 1084
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 521 place count 143 transition count 1074
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 541 place count 133 transition count 1074
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 545 place count 131 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 546 place count 130 transition count 1040
Iterating global reduction 1 with 1 rules applied. Total rules applied 547 place count 130 transition count 1040
Applied a total of 547 rules in 36 ms. Remains 130 /143 variables (removed 13) and now considering 1040/1605 (removed 565) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1040 rows 130 cols
[2025-05-31 23:15:07] [INFO ] Computed 2 invariants in 20 ms
[2025-05-31 23:15:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:15:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:15:08] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2025-05-31 23:15:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:15:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:15:08] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-31 23:15:08] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-31 23:15:08] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-05-31 23:15:08] [INFO ] Flatten gal took : 33 ms
[2025-05-31 23:15:08] [INFO ] Flatten gal took : 32 ms
[2025-05-31 23:15:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality981396316916421533.gal : 6 ms
[2025-05-31 23:15:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3112004147684807457.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/ReachabilityCardinality981396316916421533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3112004147684807457.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/ReachabilityCardinality3112004147684807457.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 60
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :60 after 302
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :302 after 1056
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1056 after 5102
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :5102 after 36237
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :36237 after 171406
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :171406 after 1.13193e+08
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.13193e+08 after 4.79586e+08
Detected timeout of ITS tools.
[2025-05-31 23:15:23] [INFO ] Flatten gal took : 31 ms
[2025-05-31 23:15:23] [INFO ] Applying decomposition
[2025-05-31 23:15:23] [INFO ] Flatten gal took : 31 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/graph3094948032389219152.txt' '-o' '/tmp/graph3094948032389219152.bin' '-w' '/tmp/graph3094948032389219152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3094948032389219152.bin' '-l' '-1' '-v' '-w' '/tmp/graph3094948032389219152.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:15:24] [INFO ] Decomposing Gal with order
[2025-05-31 23:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:15:24] [INFO ] Removed a total of 2379 redundant transitions.
[2025-05-31 23:15:24] [INFO ] Flatten gal took : 64 ms
[2025-05-31 23:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 21 ms.
[2025-05-31 23:15:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12786228087459423976.gal : 6 ms
[2025-05-31 23:15:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16707068198651691687.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/ReachabilityCardinality12786228087459423976.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16707068198651691687.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/ReachabilityCardinality16707068198651691687.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 228
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :228 after 8008
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :8008 after 8008
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8008 after 251201
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :251201 after 304512
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :304512 after 1.11039e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.11039e+06 after 6.3962e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31609 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3, 5, 4] Max Struct:[+inf, +inf, +inf, +inf]
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01
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-05-31 23:15:39] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
// Phase 1: matrix 1084 rows 143 cols
[2025-05-31 23:15:39] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (104 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-05-31 23:15:39] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:15:39] [INFO ] Invariant cache hit.
[2025-05-31 23:15:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:15:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:15:39] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-31 23:15:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:15:39] [INFO ] [Real]Added 116 Read/Feed constraints in 41 ms returned sat
[2025-05-31 23:15:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:15:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:15:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:15:39] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-05-31 23:15:39] [INFO ] [Nat]Added 116 Read/Feed constraints in 100 ms returned sat
[2025-05-31 23:15:39] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 69 ms.
[2025-05-31 23:15:39] [INFO ] Added : 0 causal constraints over 0 iterations in 138 ms. Result :sat
Minimization took 567 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 143/143 places, 1605/1605 transitions.
[2025-05-31 23:15:40] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 699=1, 700=1, 1033=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 714=1, 715=1, 1050=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 153 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-05-31 23:15:41] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:15:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10252 resets) in 1130 ms. (884 steps per ms)
BEST_FIRST walk for 1000001 steps (1950 resets) in 462 ms. (2159 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-05-31 23:15:42] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:15:42] [INFO ] Invariant cache hit.
[2025-05-31 23:15:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:15:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:15:42] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-05-31 23:15:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:15:42] [INFO ] [Real]Added 116 Read/Feed constraints in 63 ms returned sat
[2025-05-31 23:15:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:15:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:15:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:15:43] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-05-31 23:15:43] [INFO ] [Nat]Added 116 Read/Feed constraints in 237 ms returned sat
[2025-05-31 23:15:43] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 68 ms.
[2025-05-31 23:15:43] [INFO ] Added : 0 causal constraints over 0 iterations in 133 ms. Result :sat
Minimization took 975 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1605/1605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
[2025-05-31 23:15:44] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:15:44] [INFO ] Invariant cache hit.
[2025-05-31 23:15:44] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-31 23:15:44] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:15:44] [INFO ] Invariant cache hit.
[2025-05-31 23:15:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:15:45] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2025-05-31 23:15:45] [INFO ] Redundant transitions in 28 ms returned []
Running 1603 sub problems to find dead transitions.
[2025-05-31 23:15:45] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:15:45] [INFO ] Invariant cache hit.
[2025-05-31 23:15:45] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 1603/1864 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 1864 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
After SMT, in 62168ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 62182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63142 ms. Remains : 143/143 places, 1605/1605 transitions.
[2025-05-31 23:16:47] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 699=1, 700=1, 1033=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 714=1, 715=1, 1050=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 166 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-05-31 23:16:48] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:16:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10169 resets) in 1117 ms. (894 steps per ms)
BEST_FIRST walk for 1000001 steps (1912 resets) in 464 ms. (2150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-05-31 23:16:49] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:16:49] [INFO ] Invariant cache hit.
[2025-05-31 23:16:49] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:16:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:16:50] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-31 23:16:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:16:50] [INFO ] [Real]Added 116 Read/Feed constraints in 66 ms returned sat
[2025-05-31 23:16:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:16:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 23:16:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:16:50] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:16:50] [INFO ] [Nat]Added 116 Read/Feed constraints in 243 ms returned sat
[2025-05-31 23:16:50] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 68 ms.
[2025-05-31 23:16:50] [INFO ] Added : 0 causal constraints over 0 iterations in 135 ms. Result :sat
Minimization took 1004 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1605/1605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
[2025-05-31 23:16:51] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:16:51] [INFO ] Invariant cache hit.
[2025-05-31 23:16:51] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-31 23:16:51] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:16:51] [INFO ] Invariant cache hit.
[2025-05-31 23:16:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:16:52] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2025-05-31 23:16:52] [INFO ] Redundant transitions in 28 ms returned []
Running 1603 sub problems to find dead transitions.
[2025-05-31 23:16:52] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:16:52] [INFO ] Invariant cache hit.
[2025-05-31 23:16:52] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 1603/1864 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 1864 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
After SMT, in 62135ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 62149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63098 ms. Remains : 143/143 places, 1605/1605 transitions.
[2025-05-31 23:17:54] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 699=1, 700=1, 1033=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 714=1, 715=1, 1050=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 157 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-05-31 23:17:55] [INFO ] Flatten gal took : 39 ms
RANDOM walk for 40016 steps (412 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2025-05-31 23:17:55] [INFO ] Flatten gal took : 72 ms
[2025-05-31 23:17:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6675010614801941356.gal : 10 ms
[2025-05-31 23:17:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15124470754216284956.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/ReachabilityCardinality6675010614801941356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15124470754216284956.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15124470754216284956.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 19667
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :19667 after 77151
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :77151 after 238763
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :238763 after 1.04206e+07
Interrupted probabilistic random walk after 586377 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 1
Probabilistic random walk after 586377 steps, saw 397206 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2025-05-31 23:17:58] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:17:58] [INFO ] Invariant cache hit.
[2025-05-31 23:17:58] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1124 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1142 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1227 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1124 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.04206e+07 after 3.91574e+07
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1142 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1142 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1227 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1227 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1227 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1605/1605 transitions.
RANDOM walk for 40007 steps (396 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 513528 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 513528 steps, saw 348460 distinct states, run finished after 3003 ms. (steps per millisecond=171 ) properties seen :0
[2025-05-31 23:18:02] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:18:02] [INFO ] Invariant cache hit.
[2025-05-31 23:18:02] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1124 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1142 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1227 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1227 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1124 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1142 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1142 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1227 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1227 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1227 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1227 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1227 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1605/1605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1605/1605 (removed 0) transitions.
[2025-05-31 23:18:03] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:18:03] [INFO ] Invariant cache hit.
[2025-05-31 23:18:03] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-31 23:18:03] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:18:03] [INFO ] Invariant cache hit.
[2025-05-31 23:18:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:18:03] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2025-05-31 23:18:03] [INFO ] Redundant transitions in 26 ms returned []
Running 1603 sub problems to find dead transitions.
[2025-05-31 23:18:03] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:18:03] [INFO ] Invariant cache hit.
[2025-05-31 23:18:03] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.91574e+07 after 9.6564e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/1227 variables, and 261 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1227 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:18:45] [INFO ] Flatten gal took : 39 ms
[2025-05-31 23:18:45] [INFO ] Applying decomposition
[2025-05-31 23:18:45] [INFO ] Flatten gal took : 41 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/graph1399600318342286518.txt' '-o' '/tmp/graph1399600318342286518.bin' '-w' '/tmp/graph1399600318342286518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1399600318342286518.bin' '-l' '-1' '-v' '-w' '/tmp/graph1399600318342286518.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:18:45] [INFO ] Decomposing Gal with order
[2025-05-31 23:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:18:45] [INFO ] Removed a total of 3790 redundant transitions.
[2025-05-31 23:18:45] [INFO ] Flatten gal took : 75 ms
[2025-05-31 23:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 37 ms.
[2025-05-31 23:18:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality736964765796240754.gal : 8 ms
[2025-05-31 23:18:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2167820511408877092.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/ReachabilityCardinality736964765796240754.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2167820511408877092.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality2167820511408877092.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 1603/1864 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/1227 variables, and 1864 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 0/0 constraints]
After SMT, in 62238ms problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 62251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63170 ms. Remains : 143/143 places, 1605/1605 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 521 transitions
Reduce isomorphic transitions removed 521 transitions.
Iterating post reduction 0 with 521 rules applied. Total rules applied 521 place count 143 transition count 1084
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 521 place count 143 transition count 1074
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 541 place count 133 transition count 1074
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 547 place count 130 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 548 place count 129 transition count 1039
Iterating global reduction 1 with 1 rules applied. Total rules applied 549 place count 129 transition count 1039
Applied a total of 549 rules in 33 ms. Remains 129 /143 variables (removed 14) and now considering 1039/1605 (removed 566) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1039 rows 129 cols
[2025-05-31 23:19:06] [INFO ] Computed 2 invariants in 10 ms
[2025-05-31 23:19:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-05-31 23:19:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:19:06] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:19:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:19:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:19:06] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:19:06] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:19:06] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:19:06] [INFO ] Flatten gal took : 31 ms
[2025-05-31 23:19:06] [INFO ] Flatten gal took : 25 ms
[2025-05-31 23:19:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9699472413509689467.gal : 5 ms
[2025-05-31 23:19:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6866464036254460911.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/ReachabilityCardinality9699472413509689467.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6866464036254460911.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6866464036254460911.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 449
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :449 after 5027
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5027 after 38610
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :38610 after 108040
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :108040 after 209869
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :209869 after 9.35257e+07
Detected timeout of ITS tools.
[2025-05-31 23:19:21] [INFO ] Flatten gal took : 25 ms
[2025-05-31 23:19:21] [INFO ] Applying decomposition
[2025-05-31 23:19:21] [INFO ] Flatten gal took : 25 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/graph8881204543249776439.txt' '-o' '/tmp/graph8881204543249776439.bin' '-w' '/tmp/graph8881204543249776439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8881204543249776439.bin' '-l' '-1' '-v' '-w' '/tmp/graph8881204543249776439.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:19:22] [INFO ] Decomposing Gal with order
[2025-05-31 23:19:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:19:22] [INFO ] Removed a total of 2410 redundant transitions.
[2025-05-31 23:19:22] [INFO ] Flatten gal took : 47 ms
[2025-05-31 23:19:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 12 ms.
[2025-05-31 23:19:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5349798733459590799.gal : 4 ms
[2025-05-31 23:19:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10770168223365772471.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/ReachabilityCardinality5349798733459590799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10770168223365772471.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/ReachabilityCardinality10770168223365772471.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 174
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :174 after 21816
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :21816 after 174052
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :174052 after 182737
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :182737 after 201322
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :201322 after 281647
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,620272,2.16261,68228,1824,350,53219,7266,1313,558814,30,81275,0
Total reachable state count : 620272
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,45,2.1654,68228,64,33,53219,7266,1321,558814,34,81275,0
Over-approximation ignoring read arcs solved 0 properties in 18065 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01 in 225101 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07
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-05-31 23:19:24] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
// Phase 1: matrix 1084 rows 143 cols
[2025-05-31 23:19:24] [INFO ] Computed 2 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10005 steps (105 resets) in 14 ms. (667 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-05-31 23:19:24] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:19:24] [INFO ] Invariant cache hit.
[2025-05-31 23:19:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:19:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:19:24] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-05-31 23:19:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:19:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:19:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:19:24] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-05-31 23:19:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:19:24] [INFO ] [Nat]Added 116 Read/Feed constraints in 107 ms returned sat
[2025-05-31 23:19:24] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 69 ms.
[2025-05-31 23:19:25] [INFO ] Added : 0 causal constraints over 0 iterations in 129 ms. Result :sat
Minimization took 566 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1589
Applied a total of 16 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1605 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 143/143 places, 1589/1605 transitions.
[2025-05-31 23:19:25] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 677=1, 678=1, 1011=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 701=1, 702=1, 1035=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 165 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-05-31 23:19:26] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
// Phase 1: matrix 1068 rows 143 cols
[2025-05-31 23:19:26] [INFO ] Computed 3 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000005 steps (10185 resets) in 1145 ms. (872 steps per ms)
BEST_FIRST walk for 1000001 steps (1932 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-05-31 23:19:27] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:19:27] [INFO ] Invariant cache hit.
[2025-05-31 23:19:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:19:27] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-05-31 23:19:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:19:27] [INFO ] [Real]Added 116 Read/Feed constraints in 44 ms returned sat
[2025-05-31 23:19:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:19:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:19:28] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-05-31 23:19:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 84 ms returned sat
[2025-05-31 23:19:28] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 2 ms to minimize.
[2025-05-31 23:19:28] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 2 ms to minimize.
[2025-05-31 23:19:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2025-05-31 23:19:28] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 962 transitions) in 68 ms.
[2025-05-31 23:19:28] [INFO ] Added : 0 causal constraints over 0 iterations in 135 ms. Result :sat
Minimization took 949 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1589/1589 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1589/1589 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1589/1589 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2025-05-31 23:19:29] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:19:29] [INFO ] Invariant cache hit.
[2025-05-31 23:19:30] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-31 23:19:30] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:19:30] [INFO ] Invariant cache hit.
[2025-05-31 23:19:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:19:30] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2025-05-31 23:19:30] [INFO ] Redundant transitions in 26 ms returned []
Running 1587 sub problems to find dead transitions.
[2025-05-31 23:19:30] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:19:30] [INFO ] Invariant cache hit.
[2025-05-31 23:19:30] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
[2025-05-31 23:19:44] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 4 ms to minimize.
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
[2025-05-31 23:19:44] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 1 ms to minimize.
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 timeout
0.0)
(s9 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1068/1211 variables, 143/148 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
SMT process timed out in 32104ms, After SMT, problems are : Problem set: 53 solved, 1534 unsolved
Search for dead transitions found 53 dead transitions in 32118ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1589 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:20:03] [INFO ] Redundant transitions in 22 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33068 ms. Remains : 143/143 places, 1536/1589 transitions.
[2025-05-31 23:20:03] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 152 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-05-31 23:20:03] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2025-05-31 23:20:03] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000008 steps (10158 resets) in 1116 ms. (895 steps per ms)
BEST_FIRST walk for 1000001 steps (1964 resets) in 485 ms. (2057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-05-31 23:20:05] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:20:05] [INFO ] Invariant cache hit.
[2025-05-31 23:20:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:20:05] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-05-31 23:20:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:20:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:20:05] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-05-31 23:20:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:20:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 101 ms returned sat
[2025-05-31 23:20:05] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 1 ms to minimize.
[2025-05-31 23:20:06] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 1 ms to minimize.
[2025-05-31 23:20:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2025-05-31 23:20:06] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 69 ms.
[2025-05-31 23:20:06] [INFO ] Added : 0 causal constraints over 0 iterations in 139 ms. Result :sat
Minimization took 1242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:20:07] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:20:07] [INFO ] Invariant cache hit.
[2025-05-31 23:20:07] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 23:20:07] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:20:07] [INFO ] Invariant cache hit.
[2025-05-31 23:20:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:20:08] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2025-05-31 23:20:08] [INFO ] Redundant transitions in 26 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-05-31 23:20:08] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:20:08] [INFO ] Invariant cache hit.
[2025-05-31 23:20:08] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62026ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62046ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62871 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-05-31 23:21:10] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 157 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40012 steps (408 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2025-05-31 23:21:10] [INFO ] Flatten gal took : 35 ms
BEST_FIRST walk for 40004 steps (81 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2025-05-31 23:21:10] [INFO ] Flatten gal took : 33 ms
[2025-05-31 23:21:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3249748206818168179.gal : 6 ms
[2025-05-31 23:21:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5276594325654099466.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/ReachabilityCardinality3249748206818168179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5276594325654099466.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5276594325654099466.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 616019 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 616019 steps, saw 417040 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2025-05-31 23:21:13] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:21:13] [INFO ] Invariant cache hit.
[2025-05-31 23:21:13] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 37034 steps (370 resets) in 81 ms. (451 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 110406 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-09
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-05-31 23:21:14] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
// Phase 1: matrix 1084 rows 143 cols
[2025-05-31 23:21:14] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (98 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-05-31 23:21:14] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:21:14] [INFO ] Invariant cache hit.
[2025-05-31 23:21:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:21:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:21:14] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-31 23:21:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:21:14] [INFO ] [Real]Added 116 Read/Feed constraints in 33 ms returned sat
[2025-05-31 23:21:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:21:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:21:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:21:15] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2025-05-31 23:21:15] [INFO ] [Nat]Added 116 Read/Feed constraints in 142 ms returned sat
[2025-05-31 23:21:15] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 81 ms.
[2025-05-31 23:21:15] [INFO ] Added : 1 causal constraints over 1 iterations in 187 ms. Result :sat
Minimization took 565 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1589
Applied a total of 16 rules in 27 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1605 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 143/143 places, 1589/1605 transitions.
[2025-05-31 23:21:16] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 677=1, 678=1, 1011=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 701=1, 702=1, 1035=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 157 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-05-31 23:21:16] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
// Phase 1: matrix 1068 rows 143 cols
[2025-05-31 23:21:16] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10167 resets) in 1109 ms. (900 steps per ms)
BEST_FIRST walk for 1000001 steps (1889 resets) in 467 ms. (2136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 23:21:18] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:21:18] [INFO ] Invariant cache hit.
[2025-05-31 23:21:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:21:18] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-31 23:21:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:21:18] [INFO ] [Real]Added 116 Read/Feed constraints in 66 ms returned sat
[2025-05-31 23:21:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:21:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:21:18] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-05-31 23:21:18] [INFO ] [Nat]Added 116 Read/Feed constraints in 147 ms returned sat
[2025-05-31 23:21:18] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 962 transitions) in 66 ms.
[2025-05-31 23:21:18] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 1160 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1589/1589 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1589/1589 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1589/1589 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2025-05-31 23:21:20] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:21:20] [INFO ] Invariant cache hit.
[2025-05-31 23:21:20] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 23:21:20] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:21:20] [INFO ] Invariant cache hit.
[2025-05-31 23:21:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:21:20] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2025-05-31 23:21:20] [INFO ] Redundant transitions in 26 ms returned []
Running 1587 sub problems to find dead transitions.
[2025-05-31 23:21:20] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:21:20] [INFO ] Invariant cache hit.
[2025-05-31 23:21:21] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
[2025-05-31 23:21:34] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 1 ms to minimize.
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
[2025-05-31 23:21:34] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1068/1211 variables, 143/148 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
SMT process timed out in 32048ms, After SMT, problems are : Problem set: 53 solved, 1534 unsolved
Search for dead transitions found 53 dead transitions in 32062ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1589 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:21:53] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32943 ms. Remains : 143/143 places, 1536/1589 transitions.
[2025-05-31 23:21:53] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 154 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 23:21:53] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2025-05-31 23:21:53] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10157 resets) in 1157 ms. (863 steps per ms)
BEST_FIRST walk for 1000001 steps (1913 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 23:21:55] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:21:55] [INFO ] Invariant cache hit.
[2025-05-31 23:21:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:21:55] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-31 23:21:55] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:21:55] [INFO ] [Real]Added 112 Read/Feed constraints in 74 ms returned sat
[2025-05-31 23:21:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:21:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:21:55] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:21:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 106 ms returned sat
[2025-05-31 23:21:56] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 2 ms to minimize.
[2025-05-31 23:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2025-05-31 23:21:56] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 63 ms.
[2025-05-31 23:21:56] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 894 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:21:57] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:21:57] [INFO ] Invariant cache hit.
[2025-05-31 23:21:57] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-31 23:21:57] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:21:57] [INFO ] Invariant cache hit.
[2025-05-31 23:21:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:21:58] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2025-05-31 23:21:58] [INFO ] Redundant transitions in 25 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-05-31 23:21:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:21:58] [INFO ] Invariant cache hit.
[2025-05-31 23:21:58] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62158ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63008 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-05-31 23:23:00] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 146 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40002 steps (410 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (75 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2025-05-31 23:23:00] [INFO ] Flatten gal took : 38 ms
[2025-05-31 23:23:00] [INFO ] Flatten gal took : 36 ms
[2025-05-31 23:23:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13428429845498488483.gal : 6 ms
[2025-05-31 23:23:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8334706508338431681.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/ReachabilityCardinality13428429845498488483.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8334706508338431681.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8334706508338431681.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 562936 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562936 steps, saw 381521 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2025-05-31 23:23:03] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:23:03] [INFO ] Invariant cache hit.
[2025-05-31 23:23:03] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 77/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 77/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40003 steps (404 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 582984 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 582984 steps, saw 394936 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2025-05-31 23:23:07] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:23:07] [INFO ] Invariant cache hit.
[2025-05-31 23:23:07] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 77/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 77/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 757ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:23:08] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:23:08] [INFO ] Invariant cache hit.
[2025-05-31 23:23:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-05-31 23:23:08] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:23:08] [INFO ] Invariant cache hit.
[2025-05-31 23:23:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:23:09] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2025-05-31 23:23:09] [INFO ] Redundant transitions in 24 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-05-31 23:23:09] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:23:09] [INFO ] Invariant cache hit.
[2025-05-31 23:23:09] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70773e+07 after 6.72957e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:23:51] [INFO ] Flatten gal took : 32 ms
[2025-05-31 23:23:51] [INFO ] Applying decomposition
[2025-05-31 23:23:51] [INFO ] Flatten gal took : 32 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/graph16009188015416086635.txt' '-o' '/tmp/graph16009188015416086635.bin' '-w' '/tmp/graph16009188015416086635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16009188015416086635.bin' '-l' '-1' '-v' '-w' '/tmp/graph16009188015416086635.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:23:51] [INFO ] Decomposing Gal with order
[2025-05-31 23:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:23:51] [INFO ] Removed a total of 3594 redundant transitions.
[2025-05-31 23:23:51] [INFO ] Flatten gal took : 71 ms
[2025-05-31 23:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 16 ms.
[2025-05-31 23:23:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16045424728510003107.gal : 7 ms
[2025-05-31 23:23:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13227341280628287808.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/ReachabilityCardinality16045424728510003107.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13227341280628287808.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/ReachabilityCardinality13227341280628287808.prop.
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62322ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63142 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 543 place count 129 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 544 place count 128 transition count 975
Iterating global reduction 1 with 1 rules applied. Total rules applied 545 place count 128 transition count 975
Applied a total of 545 rules in 38 ms. Remains 128 /143 variables (removed 15) and now considering 975/1536 (removed 561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 975 rows 128 cols
[2025-05-31 23:24:11] [INFO ] Computed 3 invariants in 9 ms
[2025-05-31 23:24:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:24:11] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:24:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:24:12] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:24:12] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:24:12] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:24:12] [INFO ] Flatten gal took : 22 ms
[2025-05-31 23:24:12] [INFO ] Flatten gal took : 22 ms
[2025-05-31 23:24:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17644011039250286855.gal : 4 ms
[2025-05-31 23:24:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality509870785152051097.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/ReachabilityCardinality17644011039250286855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality509870785152051097.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality509870785152051097.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3102 after 35893
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35893 after 90892
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :90892 after 153095
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :153095 after 305125
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :305125 after 4.70707e+08
Detected timeout of ITS tools.
[2025-05-31 23:24:27] [INFO ] Flatten gal took : 25 ms
[2025-05-31 23:24:27] [INFO ] Applying decomposition
[2025-05-31 23:24:27] [INFO ] Flatten gal took : 22 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/graph466248430135234832.txt' '-o' '/tmp/graph466248430135234832.bin' '-w' '/tmp/graph466248430135234832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph466248430135234832.bin' '-l' '-1' '-v' '-w' '/tmp/graph466248430135234832.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:24:27] [INFO ] Decomposing Gal with order
[2025-05-31 23:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:24:27] [INFO ] Removed a total of 2278 redundant transitions.
[2025-05-31 23:24:27] [INFO ] Flatten gal took : 38 ms
[2025-05-31 23:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 10 ms.
[2025-05-31 23:24:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11878824077836418396.gal : 4 ms
[2025-05-31 23:24:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3999651569089980622.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/ReachabilityCardinality11878824077836418396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3999651569089980622.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/ReachabilityCardinality3999651569089980622.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 196
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :196 after 13013
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13013 after 16016
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.36027e+06 after 2.36044e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.36044e+06 after 2.37045e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30895 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-09 in 207880 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13
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-05-31 23:24:42] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
// Phase 1: matrix 1084 rows 143 cols
[2025-05-31 23:24:42] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (100 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-05-31 23:24:42] [INFO ] Flow matrix only has 1084 transitions (discarded 521 similar events)
[2025-05-31 23:24:42] [INFO ] Invariant cache hit.
[2025-05-31 23:24:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:24:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 23:24:42] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-05-31 23:24:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:24:42] [INFO ] [Real]Added 116 Read/Feed constraints in 42 ms returned sat
[2025-05-31 23:24:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:24:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 23:24:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 23:24:43] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-05-31 23:24:43] [INFO ] [Nat]Added 116 Read/Feed constraints in 134 ms returned sat
[2025-05-31 23:24:43] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 978 transitions) in 73 ms.
[2025-05-31 23:24:43] [INFO ] Added : 0 causal constraints over 0 iterations in 142 ms. Result :sat
Minimization took 623 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1605/1605 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1589
Applied a total of 16 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1605 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 143/143 places, 1589/1605 transitions.
[2025-05-31 23:24:44] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 677=1, 678=1, 1011=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 701=1, 702=1, 1035=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 153 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-05-31 23:24:44] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
// Phase 1: matrix 1068 rows 143 cols
[2025-05-31 23:24:44] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10190 resets) in 1195 ms. (836 steps per ms)
BEST_FIRST walk for 1000001 steps (1936 resets) in 490 ms. (2036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-05-31 23:24:46] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:24:46] [INFO ] Invariant cache hit.
[2025-05-31 23:24:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:24:46] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-05-31 23:24:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:24:46] [INFO ] [Real]Added 116 Read/Feed constraints in 40 ms returned sat
[2025-05-31 23:24:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:24:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:24:46] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 23:24:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 148 ms returned sat
[2025-05-31 23:24:46] [INFO ] Computed and/alt/rep : 104/744/104 causal constraints (skipped 962 transitions) in 87 ms.
[2025-05-31 23:24:47] [INFO ] Added : 2 causal constraints over 2 iterations in 228 ms. Result :sat
Minimization took 1018 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1589/1589 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1589/1589 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1589/1589 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2025-05-31 23:24:48] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:24:48] [INFO ] Invariant cache hit.
[2025-05-31 23:24:48] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-31 23:24:48] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:24:48] [INFO ] Invariant cache hit.
[2025-05-31 23:24:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-05-31 23:24:49] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2025-05-31 23:24:49] [INFO ] Redundant transitions in 24 ms returned []
Running 1587 sub problems to find dead transitions.
[2025-05-31 23:24:49] [INFO ] Flow matrix only has 1068 transitions (discarded 521 similar events)
[2025-05-31 23:24:49] [INFO ] Invariant cache hit.
[2025-05-31 23:24:49] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
[2025-05-31 23:25:03] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 1 ms to minimize.
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
[2025-05-31 23:25:03] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 1 ms to minimize.
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1068/1211 variables, 143/148 constraints. Problems are: Problem set: 53 solved, 1534 unsolved
SMT process timed out in 32341ms, After SMT, problems are : Problem set: 53 solved, 1534 unsolved
Search for dead transitions found 53 dead transitions in 32362ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1589 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:25:21] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33299 ms. Remains : 143/143 places, 1536/1589 transitions.
[2025-05-31 23:25:21] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 148 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-05-31 23:25:22] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2025-05-31 23:25:22] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10176 resets) in 1167 ms. (856 steps per ms)
BEST_FIRST walk for 1000000 steps (1949 resets) in 507 ms. (1968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-05-31 23:25:23] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:25:23] [INFO ] Invariant cache hit.
[2025-05-31 23:25:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 23:25:23] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-31 23:25:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:25:23] [INFO ] [Real]Added 112 Read/Feed constraints in 35 ms returned sat
[2025-05-31 23:25:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:25:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:25:24] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-05-31 23:25:24] [INFO ] [Nat]Added 112 Read/Feed constraints in 81 ms returned sat
[2025-05-31 23:25:24] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 1 ms to minimize.
[2025-05-31 23:25:24] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 1 ms to minimize.
[2025-05-31 23:25:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2025-05-31 23:25:24] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 69 ms.
[2025-05-31 23:25:24] [INFO ] Added : 0 causal constraints over 0 iterations in 132 ms. Result :sat
Minimization took 905 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:25:25] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:25:25] [INFO ] Invariant cache hit.
[2025-05-31 23:25:25] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-31 23:25:25] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:25:25] [INFO ] Invariant cache hit.
[2025-05-31 23:25:25] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:25:26] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2025-05-31 23:25:26] [INFO ] Redundant transitions in 21 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-05-31 23:25:26] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:25:26] [INFO ] Invariant cache hit.
[2025-05-31 23:25:26] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62303ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63081 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-05-31 23:26:28] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 161 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40005 steps (402 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2025-05-31 23:26:29] [INFO ] Flatten gal took : 51 ms
BEST_FIRST walk for 40003 steps (75 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2025-05-31 23:26:29] [INFO ] Flatten gal took : 73 ms
[2025-05-31 23:26:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13296255213769727934.gal : 5 ms
[2025-05-31 23:26:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17456086042860594413.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/ReachabilityCardinality13296255213769727934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17456086042860594413.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/ReachabilityCardinality17456086042860594413.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 598559 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 598559 steps, saw 405358 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2025-05-31 23:26:32] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:26:32] [INFO ] Invariant cache hit.
[2025-05-31 23:26:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40006 steps (405 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (75 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 585086 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 585086 steps, saw 396343 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2025-05-31 23:26:36] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:26:36] [INFO ] Invariant cache hit.
[2025-05-31 23:26:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-05-31 23:26:36] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:26:36] [INFO ] Invariant cache hit.
[2025-05-31 23:26:37] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-31 23:26:37] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:26:37] [INFO ] Invariant cache hit.
[2025-05-31 23:26:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:26:37] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2025-05-31 23:26:37] [INFO ] Redundant transitions in 20 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-05-31 23:26:37] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-05-31 23:26:37] [INFO ] Invariant cache hit.
[2025-05-31 23:26:37] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70773e+07 after 6.72957e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:27:19] [INFO ] Flatten gal took : 41 ms
[2025-05-31 23:27:19] [INFO ] Applying decomposition
[2025-05-31 23:27:19] [INFO ] Flatten gal took : 33 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/graph14835837852966828501.txt' '-o' '/tmp/graph14835837852966828501.bin' '-w' '/tmp/graph14835837852966828501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14835837852966828501.bin' '-l' '-1' '-v' '-w' '/tmp/graph14835837852966828501.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:27:19] [INFO ] Decomposing Gal with order
[2025-05-31 23:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:27:19] [INFO ] Removed a total of 3594 redundant transitions.
[2025-05-31 23:27:19] [INFO ] Flatten gal took : 59 ms
[2025-05-31 23:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 17 ms.
[2025-05-31 23:27:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8111607819257501700.gal : 9 ms
[2025-05-31 23:27:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3318439110998301941.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/ReachabilityCardinality8111607819257501700.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3318439110998301941.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 ...307
Loading property file /tmp/ReachabilityCardinality3318439110998301941.prop.
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62619ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63472 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 543 place count 129 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 544 place count 128 transition count 975
Iterating global reduction 1 with 1 rules applied. Total rules applied 545 place count 128 transition count 975
Applied a total of 545 rules in 20 ms. Remains 128 /143 variables (removed 15) and now considering 975/1536 (removed 561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 975 rows 128 cols
[2025-05-31 23:27:40] [INFO ] Computed 3 invariants in 7 ms
[2025-05-31 23:27:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:27:40] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 23:27:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 23:27:40] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 23:27:40] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:27:40] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 23:27:40] [INFO ] Flatten gal took : 23 ms
[2025-05-31 23:27:40] [INFO ] Flatten gal took : 23 ms
[2025-05-31 23:27:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14295536612438536619.gal : 4 ms
[2025-05-31 23:27:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16195561571686312332.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/ReachabilityCardinality14295536612438536619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16195561571686312332.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/ReachabilityCardinality16195561571686312332.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3102 after 35893
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35893 after 90892
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :90892 after 153095
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :153095 after 305125
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :305125 after 4.70707e+08
Detected timeout of ITS tools.
[2025-05-31 23:27:56] [INFO ] Flatten gal took : 49 ms
[2025-05-31 23:27:56] [INFO ] Applying decomposition
[2025-05-31 23:27:56] [INFO ] Flatten gal took : 24 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/graph8531971765382335626.txt' '-o' '/tmp/graph8531971765382335626.bin' '-w' '/tmp/graph8531971765382335626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8531971765382335626.bin' '-l' '-1' '-v' '-w' '/tmp/graph8531971765382335626.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:27:56] [INFO ] Decomposing Gal with order
[2025-05-31 23:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:27:56] [INFO ] Removed a total of 2278 redundant transitions.
[2025-05-31 23:27:56] [INFO ] Flatten gal took : 42 ms
[2025-05-31 23:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 9 ms.
[2025-05-31 23:27:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15105730252439810672.gal : 4 ms
[2025-05-31 23:27:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8919585542218313888.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/ReachabilityCardinality15105730252439810672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8919585542218313888.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/ReachabilityCardinality8919585542218313888.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 196
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :196 after 2651
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :205062 after 210067
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :210067 after 354130
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :354130 after 1.75905e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.75905e+06 after 1.05589e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.05589e+07 after 1.05723e+08
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.19028e+09,11.5136,217328,6035,390,287456,8589,1209,840555,29,71528,0
Total reachable state count : 3190279268
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,40,11.5381,217328,42,20,287456,8589,1217,840555,33,71528,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 27419 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 205209 ms.
[2025-05-31 23:28:07] [INFO ] Flatten gal took : 34 ms
[2025-05-31 23:28:07] [INFO ] Applying decomposition
[2025-05-31 23:28:07] [INFO ] Flatten gal took : 44 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/graph1569495606414896994.txt' '-o' '/tmp/graph1569495606414896994.bin' '-w' '/tmp/graph1569495606414896994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1569495606414896994.bin' '-l' '-1' '-v' '-w' '/tmp/graph1569495606414896994.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:28:07] [INFO ] Decomposing Gal with order
[2025-05-31 23:28:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:28:08] [INFO ] Removed a total of 3727 redundant transitions.
[2025-05-31 23:28:08] [INFO ] Flatten gal took : 64 ms
[2025-05-31 23:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 18 ms.
[2025-05-31 23:28:08] [INFO ] Time to serialize gal into /tmp/UpperBounds15010229519412445279.gal : 5 ms
[2025-05-31 23:28:08] [INFO ] Time to serialize properties into /tmp/UpperBounds6050100713966289987.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/UpperBounds15010229519412445279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6050100713966289987.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds6050100713966289987.prop.
Detected timeout of ITS tools.
[2025-05-31 23:54:11] [INFO ] Flatten gal took : 34 ms
[2025-05-31 23:54:11] [INFO ] Time to serialize gal into /tmp/UpperBounds280446135539582232.gal : 7 ms
[2025-05-31 23:54:11] [INFO ] Time to serialize properties into /tmp/UpperBounds663628472662567539.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/UpperBounds280446135539582232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds663628472662567539.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 ...302
Loading property file /tmp/UpperBounds663628472662567539.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="DoubleLock-PT-p2s2"
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 DoubleLock-PT-p2s2, 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 r083-tall-174860079700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 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 '
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 ;