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.r069-smll-174854075800039.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 DES-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 91K 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 DES-PT-20b-UpperBounds-00
FORMULA_NAME DES-PT-20b-UpperBounds-01
FORMULA_NAME DES-PT-20b-UpperBounds-02
FORMULA_NAME DES-PT-20b-UpperBounds-03
FORMULA_NAME DES-PT-20b-UpperBounds-04
FORMULA_NAME DES-PT-20b-UpperBounds-05
FORMULA_NAME DES-PT-20b-UpperBounds-06
FORMULA_NAME DES-PT-20b-UpperBounds-07
FORMULA_NAME DES-PT-20b-UpperBounds-08
FORMULA_NAME DES-PT-20b-UpperBounds-09
FORMULA_NAME DES-PT-20b-UpperBounds-10
FORMULA_NAME DES-PT-20b-UpperBounds-11
FORMULA_NAME DES-PT-20b-UpperBounds-12
FORMULA_NAME DES-PT-20b-UpperBounds-13
FORMULA_NAME DES-PT-20b-UpperBounds-14
FORMULA_NAME DES-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748603648161

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:14:10] [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-30 11:14:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:14:10] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-05-30 11:14:10] [INFO ] Transformed 360 places.
[2025-05-30 11:14:10] [INFO ] Transformed 311 transitions.
[2025-05-30 11:14:10] [INFO ] Found NUPN structural information;
[2025-05-30 11:14:10] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 311 rows 360 cols
[2025-05-30 11:14:10] [INFO ] Computed 65 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (81 resets) in 76 ms. (129 steps per ms)
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (13 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:14:11] [INFO ] Invariant cache hit.
[2025-05-30 11:14:11] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2025-05-30 11:14:11] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2025-05-30 11:14:12] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2025-05-30 11:14:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:14:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 33 ms returned sat
[2025-05-30 11:14:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 29 ms returned sat
[2025-05-30 11:14:12] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2025-05-30 11:14:13] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 30 ms to minimize.
[2025-05-30 11:14:13] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2025-05-30 11:14:13] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2025-05-30 11:14:13] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2025-05-30 11:14:14] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 13 ms to minimize.
[2025-05-30 11:14:14] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 4 ms to minimize.
[2025-05-30 11:14:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1354 ms
[2025-05-30 11:14:14] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 46 ms.
[2025-05-30 11:14:17] [INFO ] Added : 277 causal constraints over 56 iterations in 2998 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 360 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p76) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 310/310 transitions.
Graph (complete) has 738 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 348 transition count 281
Reduce places removed 22 places and 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 47 place count 326 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 325 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 324 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 323 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 322 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 51 place count 322 transition count 267
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 69 place count 313 transition count 267
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 88 place count 294 transition count 248
Iterating global reduction 6 with 19 rules applied. Total rules applied 107 place count 294 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 107 place count 294 transition count 247
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 109 place count 293 transition count 247
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 124 place count 278 transition count 232
Iterating global reduction 6 with 15 rules applied. Total rules applied 139 place count 278 transition count 232
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 15 rules applied. Total rules applied 154 place count 278 transition count 217
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 157 place count 276 transition count 216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 157 place count 276 transition count 213
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 163 place count 273 transition count 213
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 8 with 154 rules applied. Total rules applied 317 place count 196 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 321 place count 194 transition count 138
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 322 place count 194 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 323 place count 193 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 324 place count 193 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 325 place count 192 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 326 place count 191 transition count 136
Applied a total of 326 rules in 264 ms. Remains 191 /360 variables (removed 169) and now considering 136/310 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 191/360 places, 136/310 transitions.
// Phase 1: matrix 136 rows 191 cols
[2025-05-30 11:14:18] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47764 resets) in 3251 ms. (307 steps per ms)
BEST_FIRST walk for 1000001 steps (9081 resets) in 1275 ms. (783 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:14:23] [INFO ] Invariant cache hit.
[2025-05-30 11:14:23] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-05-30 11:14:23] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2025-05-30 11:14:23] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-05-30 11:14:23] [INFO ] Computed and/alt/rep : 122/256/122 causal constraints (skipped 11 transitions) in 15 ms.
[2025-05-30 11:14:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:14:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-30 11:14:23] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2025-05-30 11:14:23] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2025-05-30 11:14:23] [INFO ] Computed and/alt/rep : 122/256/122 causal constraints (skipped 11 transitions) in 27 ms.
[2025-05-30 11:14:24] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2025-05-30 11:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-05-30 11:14:24] [INFO ] Added : 110 causal constraints over 23 iterations in 687 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 136/136 transitions.
Applied a total of 0 rules in 19 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 191/191 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 136/136 transitions.
Applied a total of 0 rules in 15 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2025-05-30 11:14:24] [INFO ] Invariant cache hit.
[2025-05-30 11:14:25] [INFO ] Implicit Places using invariants in 406 ms returned []
[2025-05-30 11:14:25] [INFO ] Invariant cache hit.
[2025-05-30 11:14:25] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2025-05-30 11:14:25] [INFO ] Redundant transitions in 4 ms returned []
Running 133 sub problems to find dead transitions.
[2025-05-30 11:14:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 2/189 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 1/190 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 7 (OVERLAPS) 136/326 variables, 190/251 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2025-05-30 11:14:31] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-05-30 11:14:31] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-05-30 11:14:31] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2025-05-30 11:14:31] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-05-30 11:14:31] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 5/256 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2025-05-30 11:14:33] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/257 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2025-05-30 11:14:35] [INFO ] Deduced a trap composed of 14 places in 354 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 1/258 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2025-05-30 11:14:36] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/259 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2025-05-30 11:14:37] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/260 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2025-05-30 11:14:39] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 1/261 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/261 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 15 (OVERLAPS) 1/327 variables, 1/262 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/262 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 17 (OVERLAPS) 0/327 variables, 0/262 constraints. Problems are: Problem set: 4 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 262 constraints, problems are : Problem set: 4 solved, 129 unsolved in 19318 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 4 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 35/35 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 17/52 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 8/60 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/60 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/185 variables, 1/61 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/61 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 5/190 variables, 8/69 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/71 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/71 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 136/326 variables, 190/261 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 129/390 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/390 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 1/327 variables, 1/391 constraints. Problems are: Problem set: 4 solved, 129 unsolved
[2025-05-30 11:15:03] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 1/392 constraints. Problems are: Problem set: 4 solved, 129 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/392 constraints. Problems are: Problem set: 4 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 392 constraints, problems are : Problem set: 4 solved, 129 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 129/133 constraints, Known Traps: 11/11 constraints]
After SMT, in 49512ms problems are : Problem set: 4 solved, 129 unsolved
Search for dead transitions found 4 dead transitions in 49526ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 191/191 places, 132/136 transitions.
Graph (complete) has 617 edges and 191 vertex of which 187 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 187 /191 variables (removed 4) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 187 cols
[2025-05-30 11:15:15] [INFO ] Computed 61 invariants in 5 ms
[2025-05-30 11:15:15] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-05-30 11:15:15] [INFO ] Invariant cache hit.
[2025-05-30 11:15:15] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 187/191 places, 132/136 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51241 ms. Remains : 187/191 places, 132/136 transitions.
[2025-05-30 11:15:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (48000 resets) in 2194 ms. (455 steps per ms)
BEST_FIRST walk for 1000001 steps (9188 resets) in 1177 ms. (848 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:15:19] [INFO ] Invariant cache hit.
[2025-05-30 11:15:19] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2025-05-30 11:15:19] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 43 ms returned sat
[2025-05-30 11:15:19] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-05-30 11:15:19] [INFO ] Computed and/alt/rep : 118/246/118 causal constraints (skipped 11 transitions) in 19 ms.
[2025-05-30 11:15:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:15:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:15:19] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 20 ms returned sat
[2025-05-30 11:15:19] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-30 11:15:19] [INFO ] Computed and/alt/rep : 118/246/118 causal constraints (skipped 11 transitions) in 16 ms.
[2025-05-30 11:15:20] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2025-05-30 11:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2025-05-30 11:15:20] [INFO ] Added : 116 causal constraints over 24 iterations in 599 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 132/132 transitions.
Applied a total of 0 rules in 12 ms. Remains 187 /187 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 187/187 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 132/132 transitions.
Applied a total of 0 rules in 11 ms. Remains 187 /187 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2025-05-30 11:15:21] [INFO ] Invariant cache hit.
[2025-05-30 11:15:21] [INFO ] Implicit Places using invariants in 322 ms returned []
[2025-05-30 11:15:21] [INFO ] Invariant cache hit.
[2025-05-30 11:15:21] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2025-05-30 11:15:21] [INFO ] Redundant transitions in 6 ms returned []
Running 129 sub problems to find dead transitions.
[2025-05-30 11:15:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 2/185 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:15:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 132/318 variables, 186/248 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:15:27] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2025-05-30 11:15:28] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2025-05-30 11:15:28] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2025-05-30 11:15:28] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2025-05-30 11:15:28] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2025-05-30 11:15:28] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 6/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 1/319 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/319 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 255 constraints, problems are : Problem set: 0 solved, 129 unsolved in 11763 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/185 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 1/186 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:15:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-05-30 11:15:35] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 132/318 variables, 186/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 129/385 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 14 (OVERLAPS) 1/319 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:15:51] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:16:00] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 388 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
After SMT, in 41874ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 41882ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42796 ms. Remains : 187/187 places, 132/132 transitions.
RANDOM walk for 40000 steps (1935 resets) in 1138 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (370 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (381 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
[2025-05-30 11:16:04] [INFO ] Flatten gal took : 131 ms
[2025-05-30 11:16:04] [INFO ] Flatten gal took : 62 ms
[2025-05-30 11:16:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17947172511278381170.gal : 26 ms
[2025-05-30 11:16:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5075848512328836440.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/ReachabilityCardinality17947172511278381170.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5075848512328836440.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/ReachabilityCardinality5075848512328836440.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 1904
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1904 after 2396
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2396 after 7000
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7000 after 87264
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :197648 after 277552
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :277552 after 863992
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.84298e+06 after 6.59491e+07
Interrupted probabilistic random walk after 903356 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 2
Probabilistic random walk after 903356 steps, saw 126849 distinct states, run finished after 3005 ms. (steps per millisecond=300 ) properties seen :0
[2025-05-30 11:16:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/70 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/112 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/146 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/155 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 108/263 variables, 155/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/276 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/278 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 22/300 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/300 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 19/319 variables, 19/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/319 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/319 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/70 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/112 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/146 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/155 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 108/263 variables, 155/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/276 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/278 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :6.59491e+07 after 3.51066e+08
At refinement iteration 20 (OVERLAPS) 22/300 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/300 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 19/319 variables, 19/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/319 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/319 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 717 ms.
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 132/132 transitions.
Applied a total of 0 rules in 7 ms. Remains 187 /187 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 187/187 places, 132/132 transitions.
RANDOM walk for 40000 steps (1955 resets) in 510 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (361 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (349 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 914292 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 2
Probabilistic random walk after 914292 steps, saw 128373 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
[2025-05-30 11:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/70 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/112 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/146 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/155 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 108/263 variables, 155/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/276 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/278 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 22/300 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/300 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 19/319 variables, 19/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/319 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/319 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/70 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/112 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/146 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/155 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 108/263 variables, 155/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/276 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/278 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 22/300 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/300 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 19/319 variables, 19/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/319 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/319 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 442 ms.
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 132/132 transitions.
Applied a total of 0 rules in 6 ms. Remains 187 /187 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 187/187 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 132/132 transitions.
Applied a total of 0 rules in 16 ms. Remains 187 /187 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2025-05-30 11:16:13] [INFO ] Invariant cache hit.
[2025-05-30 11:16:13] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-30 11:16:13] [INFO ] Invariant cache hit.
[2025-05-30 11:16:13] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2025-05-30 11:16:13] [INFO ] Redundant transitions in 7 ms returned []
Running 129 sub problems to find dead transitions.
[2025-05-30 11:16:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.51066e+08 after 1.39491e+09
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 2/185 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:16:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 129 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 129 unsolved
SDD size :1.39491e+09 after 1.75807e+09
At refinement iteration 8 (OVERLAPS) 132/318 variables, 186/248 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:16:19] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2025-05-30 11:16:19] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-05-30 11:16:20] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2025-05-30 11:16:20] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 10 ms to minimize.
[2025-05-30 11:16:20] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 3 ms to minimize.
[2025-05-30 11:16:20] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 6/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 1/319 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.75807e+09 after 1.767e+09
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/319 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 255 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14180 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 2/185 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 1/186 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:16:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-05-30 11:16:30] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 132/318 variables, 186/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 129/385 constraints. Problems are: Problem set: 0 solved, 129 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.335e+09 after 2.33617e+09
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 14 (OVERLAPS) 1/319 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-30 11:16:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Detected timeout of ITS tools.
[2025-05-30 11:16:54] [INFO ] Flatten gal took : 21 ms
[2025-05-30 11:16:54] [INFO ] Applying decomposition
[2025-05-30 11:16:54] [INFO ] Flatten gal took : 20 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/graph952650503085370707.txt' '-o' '/tmp/graph952650503085370707.bin' '-w' '/tmp/graph952650503085370707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph952650503085370707.bin' '-l' '-1' '-v' '-w' '/tmp/graph952650503085370707.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:16:55] [INFO ] Decomposing Gal with order
[2025-05-30 11:16:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:16:55] [INFO ] Removed a total of 44 redundant transitions.
[2025-05-30 11:16:55] [INFO ] Flatten gal took : 241 ms
[2025-05-30 11:16:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 20 ms.
[2025-05-30 11:16:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4746826766460644485.gal : 7 ms
[2025-05-30 11:16:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13789408923422753184.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/ReachabilityCardinality4746826766460644485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13789408923422753184.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/ReachabilityCardinality13789408923422753184.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 52
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :52 after 8036
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50736 after 476344
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :476344 after 1.10657e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.10657e+09 after 2.32431e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.32431e+09 after 4.7598e+09
[2025-05-30 11:16:56] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 15 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 388 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
After SMT, in 44276ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 44283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44980 ms. Remains : 187/187 places, 132/132 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 132
Applied a total of 1 rules in 23 ms. Remains 187 /187 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 187 cols
[2025-05-30 11:16:58] [INFO ] Computed 61 invariants in 8 ms
[2025-05-30 11:16:58] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2025-05-30 11:16:58] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2025-05-30 11:16:58] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-30 11:16:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2025-05-30 11:16:58] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2025-05-30 11:16:58] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
[2025-05-30 11:16:58] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 11:16:58] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-30 11:16:58] [INFO ] Flatten gal took : 14 ms
[2025-05-30 11:16:58] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:16:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18274123368707971890.gal : 4 ms
[2025-05-30 11:16:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11948647185423008642.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/ReachabilityCardinality18274123368707971890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11948647185423008642.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/ReachabilityCardinality11948647185423008642.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :40 after 652
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :652 after 972
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :972 after 9556
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :9556 after 128744
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :128744 after 263048
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :263048 after 1.94248e+06
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,5.90114e+12,3.67093,99420,6887,1271,165002,3947,257,582891,209,17249,0
Total reachable state count : 5901136859024

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1.25338e+06,3.68534,99420,54,145,165002,3947,260,582891,212,17249,0
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,1.25338e+06,3.68743,99420,54,145,165002,3947,266,582891,214,17249,0
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66337e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.78051e+09 after 2.80836e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.79085e+10 after 2.53178e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7.37836e+10 after 9.64522e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.4334e+11 after 2.43453e+11
Detected timeout of ITS tools.
[2025-05-30 11:17:13] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:17:13] [INFO ] Applying decomposition
[2025-05-30 11:17:13] [INFO ] Flatten gal took : 12 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/graph1138843632638504981.txt' '-o' '/tmp/graph1138843632638504981.bin' '-w' '/tmp/graph1138843632638504981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1138843632638504981.bin' '-l' '-1' '-v' '-w' '/tmp/graph1138843632638504981.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:17:13] [INFO ] Decomposing Gal with order
[2025-05-30 11:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:17:13] [INFO ] Removed a total of 49 redundant transitions.
[2025-05-30 11:17:13] [INFO ] Flatten gal took : 26 ms
[2025-05-30 11:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2025-05-30 11:17:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8822981157012075231.gal : 6 ms
[2025-05-30 11:17:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16083050879818555824.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/ReachabilityCardinality8822981157012075231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16083050879818555824.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/ReachabilityCardinality16083050879818555824.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 538
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :538 after 5380
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :50736 after 110208
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :110208 after 2.53939e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.53939e+09 after 4.73868e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.72205e+12 after 2.746e+12
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,6.82025e+12,4.29688,127200,13527,1211,371427,2885,329,256531,208,12192,0
Total reachable state count : 6820252803815

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,416,4.32136,127200,77,97,371427,2885,329,256531,210,12192,0
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,416,4.32711,127464,77,97,371427,2885,332,256531,211,12192,0
Over-approximation ignoring read arcs solved -2 properties in 19982 ms.
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 187772 ms.

BK_STOP 1748603838210

--------------------
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="DES-PT-20b"
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 DES-PT-20b, 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 r069-smll-174854075800039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;