fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r069-smll-174854075800013
Last Updated
June 24, 2025

About the Execution of 2024-gold for DBSingleClientW-PT-d1m09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15686.600 198578.00 275130.00 792.70 0 0 0 1 0 1 0 3 0 0 0 0 6 0 0 1 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.r069-smll-174854075800013.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 DBSingleClientW-PT-d1m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K 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 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601949083

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:45:52] [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 10:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:45:52] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2025-05-30 10:45:52] [INFO ] Transformed 1440 places.
[2025-05-30 10:45:52] [INFO ] Transformed 672 transitions.
[2025-05-30 10:45:52] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 756 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
Deduced a syphon composed of 1093 places in 28 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2025-05-30 10:45:53] [INFO ] Computed 6 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
RANDOM walk for 10000 steps (2285 resets) in 340 ms. (29 steps per ms)
BEST_FIRST walk for 50004 steps (4844 resets) in 252 ms. (197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
[2025-05-30 10:45:53] [INFO ] Invariant cache hit.
[2025-05-30 10:45:54] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2025-05-30 10:45:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2025-05-30 10:45:54] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2025-05-30 10:45:54] [INFO ] State equation strengthened by 418 read => feed constraints.
[2025-05-30 10:45:55] [INFO ] [Real]Added 418 Read/Feed constraints in 213 ms returned sat
[2025-05-30 10:45:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:45:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:45:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:45:55] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2025-05-30 10:45:55] [INFO ] [Nat]Added 418 Read/Feed constraints in 239 ms returned sat
[2025-05-30 10:45:56] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 189 ms.
[2025-05-30 10:45:56] [INFO ] Added : 14 causal constraints over 3 iterations in 446 ms. Result :sat
Minimization took 589 ms.
[2025-05-30 10:45:57] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:45:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:45:57] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2025-05-30 10:45:57] [INFO ] [Real]Added 418 Read/Feed constraints in 100 ms returned sat
[2025-05-30 10:45:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:45:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:45:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:45:57] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-05-30 10:45:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 128 ms returned sat
[2025-05-30 10:45:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 86 ms.
[2025-05-30 10:45:58] [INFO ] Added : 12 causal constraints over 3 iterations in 315 ms. Result :sat
Minimization took 594 ms.
[2025-05-30 10:45:59] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:45:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:45:59] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2025-05-30 10:45:59] [INFO ] [Real]Added 418 Read/Feed constraints in 259 ms returned sat
[2025-05-30 10:45:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:45:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:45:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:46:00] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2025-05-30 10:46:00] [INFO ] [Nat]Added 418 Read/Feed constraints in 183 ms returned sat
[2025-05-30 10:46:00] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 118 ms.
[2025-05-30 10:46:00] [INFO ] Added : 5 causal constraints over 2 iterations in 329 ms. Result :sat
Minimization took 705 ms.
[2025-05-30 10:46:01] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:46:01] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2025-05-30 10:46:02] [INFO ] [Real]Added 418 Read/Feed constraints in 222 ms returned sat
[2025-05-30 10:46:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:46:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:46:02] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-05-30 10:46:03] [INFO ] [Nat]Added 418 Read/Feed constraints in 223 ms returned sat
[2025-05-30 10:46:03] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 117 ms.
[2025-05-30 10:46:03] [INFO ] Added : 7 causal constraints over 2 iterations in 347 ms. Result :sat
Minimization took 607 ms.
[2025-05-30 10:46:04] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:46:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:46:04] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-05-30 10:46:04] [INFO ] [Real]Added 418 Read/Feed constraints in 166 ms returned sat
[2025-05-30 10:46:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-05-30 10:46:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:46:05] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2025-05-30 10:46:05] [INFO ] [Nat]Added 418 Read/Feed constraints in 219 ms returned sat
[2025-05-30 10:46:05] [INFO ] Deduced a trap composed of 95 places in 348 ms of which 61 ms to minimize.
[2025-05-30 10:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 441 ms
[2025-05-30 10:46:05] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 139 ms.
[2025-05-30 10:46:06] [INFO ] Added : 12 causal constraints over 3 iterations in 460 ms. Result :sat
Minimization took 570 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 182 place count 232 transition count 330
Iterating global reduction 1 with 93 rules applied. Total rules applied 275 place count 232 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 279 place count 232 transition count 326
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 349 place count 162 transition count 256
Iterating global reduction 2 with 70 rules applied. Total rules applied 419 place count 162 transition count 256
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 425 place count 162 transition count 250
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 464 place count 123 transition count 188
Iterating global reduction 3 with 39 rules applied. Total rules applied 503 place count 123 transition count 188
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 524 place count 123 transition count 167
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 535 place count 112 transition count 149
Iterating global reduction 4 with 11 rules applied. Total rules applied 546 place count 112 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 548 place count 112 transition count 147
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 555 place count 105 transition count 140
Iterating global reduction 5 with 7 rules applied. Total rules applied 562 place count 105 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 565 place count 105 transition count 137
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 570 place count 100 transition count 132
Iterating global reduction 6 with 5 rules applied. Total rules applied 575 place count 100 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 576 place count 100 transition count 131
Applied a total of 576 rules in 216 ms. Remains 100 /347 variables (removed 247) and now considering 131/672 (removed 541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 100/347 places, 131/672 transitions.
// Phase 1: matrix 131 rows 100 cols
[2025-05-30 10:46:07] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
RANDOM walk for 1000000 steps (229644 resets) in 1902 ms. (525 steps per ms)
BEST_FIRST walk for 5000004 steps (492245 resets) in 3236 ms. (1544 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
[2025-05-30 10:46:12] [INFO ] Invariant cache hit.
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-30 10:46:12] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 10:46:12] [INFO ] [Real]Added 45 Read/Feed constraints in 21 ms returned sat
[2025-05-30 10:46:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:46:12] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 12 ms.
[2025-05-30 10:46:12] [INFO ] Added : 13 causal constraints over 4 iterations in 109 ms. Result :sat
Minimization took 119 ms.
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-30 10:46:12] [INFO ] [Real]Added 45 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:46:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:46:13] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 15 ms.
[2025-05-30 10:46:13] [INFO ] Added : 11 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 65 ms.
[2025-05-30 10:46:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Real]Added 45 Read/Feed constraints in 22 ms returned sat
[2025-05-30 10:46:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-05-30 10:46:13] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:46:13] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 26 ms.
[2025-05-30 10:46:13] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2025-05-30 10:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-05-30 10:46:13] [INFO ] Added : 10 causal constraints over 4 iterations in 312 ms. Result :sat
Minimization took 152 ms.
[2025-05-30 10:46:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:46:14] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-05-30 10:46:14] [INFO ] [Real]Added 45 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:46:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:14] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-05-30 10:46:14] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:46:14] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 16 ms.
[2025-05-30 10:46:14] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-05-30 10:46:14] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2025-05-30 10:46:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2025-05-30 10:46:14] [INFO ] Added : 10 causal constraints over 3 iterations in 397 ms. Result :sat
Minimization took 173 ms.
[2025-05-30 10:46:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Real]Added 45 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:46:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-30 10:46:15] [INFO ] [Nat]Added 45 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:46:15] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 10 ms.
[2025-05-30 10:46:15] [INFO ] Added : 11 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 131/131 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 100/100 places, 131/131 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 131/131 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2025-05-30 10:46:15] [INFO ] Invariant cache hit.
[2025-05-30 10:46:15] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 10:46:15] [INFO ] Invariant cache hit.
[2025-05-30 10:46:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 10:46:15] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2025-05-30 10:46:15] [INFO ] Redundant transitions in 6 ms returned []
Running 130 sub problems to find dead transitions.
[2025-05-30 10:46:15] [INFO ] Invariant cache hit.
[2025-05-30 10:46:16] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/231 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 45/147 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 147 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4758 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/231 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 45/147 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 277 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9359 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 14631ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 14651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15160 ms. Remains : 100/100 places, 131/131 transitions.
[2025-05-30 10:46:31] [INFO ] Flatten gal took : 98 ms
[2025-05-30 10:46:31] [INFO ] Flatten gal took : 65 ms
RANDOM walk for 40000 steps (9169 resets) in 1953 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4001 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3937 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (3843 resets) in 108 ms. (366 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4005 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4039 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
[2025-05-30 10:46:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12183163220106552446.gal : 27 ms
BEST_FIRST walk for 40001 steps (3931 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
[2025-05-30 10:46:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11206299672908738529.prop : 1 ms
BEST_FIRST walk for 40001 steps (3980 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
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/ReachabilityCardinality12183163220106552446.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11206299672908738529.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (3892 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (3990 resets) in 320 ms. (124 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3891 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
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/ReachabilityCardinality11206299672908738529.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :120 after 224
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :224 after 422
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :422 after 794
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :794 after 2590
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :2590 after 17079
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :17079 after 61261
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :61261 after 183314
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :183314 after 455902
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :455902 after 3.53732e+06
Interrupted probabilistic random walk after 431835 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :5 out of 10
Probabilistic random walk after 431835 steps, saw 173689 distinct states, run finished after 3006 ms. (steps per millisecond=143 ) properties seen :5
[2025-05-30 10:46:35] [INFO ] Invariant cache hit.
[2025-05-30 10:46:35] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 56/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX4 is UNSAT
At refinement iteration 7 (OVERLAPS) 55/224 variables, 24/98 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 42/140 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/140 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/231 variables, 4/144 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/147 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2025-05-30 10:46:35] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 3 ms to minimize.
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 231/231 variables, and 148 constraints, problems are : Problem set: 5 solved, 0 unsolved in 334 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 357ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[0, 0, 0, 0, 0] Max Struct:[9, 7, 11, 9, 9]
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-03
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:[9]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[9]
[2025-05-30 10:46:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2328 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (977 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2025-05-30 10:46:35] [INFO ] Invariant cache hit.
[2025-05-30 10:46:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:35] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-05-30 10:46:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 10:46:35] [INFO ] [Real]Added 45 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:46:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:35] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-05-30 10:46:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:46:35] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 12 ms.
[2025-05-30 10:46:35] [INFO ] Added : 13 causal constraints over 4 iterations in 74 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 131/131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 94 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 94 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 94 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 92 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 92 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 92 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 90 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 90 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 89 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 89 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 89 transition count 109
Applied a total of 27 rules in 29 ms. Remains 89 /100 variables (removed 11) and now considering 109/131 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 89/100 places, 109/131 transitions.
// Phase 1: matrix 109 rows 89 cols
[2025-05-30 10:46:36] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 1000000 steps (229423 resets) in 1015 ms. (984 steps per ms)
BEST_FIRST walk for 1000001 steps (98261 resets) in 498 ms. (2004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2025-05-30 10:46:37] [INFO ] Invariant cache hit.
[2025-05-30 10:46:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:37] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-30 10:46:37] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-30 10:46:37] [INFO ] [Real]Added 33 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:46:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:37] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-30 10:46:37] [INFO ] [Nat]Added 33 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:46:37] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 77 transitions) in 11 ms.
[2025-05-30 10:46:37] [INFO ] Added : 11 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 89/89 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-05-30 10:46:38] [INFO ] Invariant cache hit.
[2025-05-30 10:46:38] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 10:46:38] [INFO ] Invariant cache hit.
[2025-05-30 10:46:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-30 10:46:38] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2025-05-30 10:46:38] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-05-30 10:46:38] [INFO ] Invariant cache hit.
[2025-05-30 10:46:38] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/198 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4415 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/198 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6735 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11342ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11789 ms. Remains : 89/89 places, 109/109 transitions.
[2025-05-30 10:46:49] [INFO ] Flatten gal took : 16 ms
RANDOM walk for 40000 steps (9108 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2025-05-30 10:46:49] [INFO ] Flatten gal took : 25 ms
[2025-05-30 10:46:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1432753588283096173.gal : 5 ms
[2025-05-30 10:46:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9103906359140340503.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/ReachabilityCardinality1432753588283096173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9103906359140340503.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
BEST_FIRST walk for 40002 steps (3942 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3992 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9103906359140340503.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 90
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :90 after 154
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :154 after 278
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :278 after 500
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :500 after 926
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :926 after 6178
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6178 after 24563
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :24563 after 107509
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :107509 after 363861
Interrupted probabilistic random walk after 2369770 steps, run timeout after 3001 ms. (steps per millisecond=789 ) properties seen :1 out of 2
Probabilistic random walk after 2369770 steps, saw 940395 distinct states, run finished after 3001 ms. (steps per millisecond=789 ) properties seen :1
[2025-05-30 10:46:52] [INFO ] Invariant cache hit.
[2025-05-30 10:46:52] [INFO ] State equation strengthened by 33 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/147 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 189/198 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 87 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/89 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[0] Max Struct:[9]
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-03 in 17437 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 131 rows 100 cols
[2025-05-30 10:46:53] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2308 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (971 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:46:53] [INFO ] Invariant cache hit.
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-05-30 10:46:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 10:46:53] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:46:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-30 10:46:53] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:46:53] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 12 ms.
[2025-05-30 10:46:53] [INFO ] Added : 11 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 131/131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 94 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 94 transition count 125
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 91 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 91 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 91 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 89 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 89 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 87 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 87 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 86 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 85 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 85 transition count 108
Applied a total of 34 rules in 27 ms. Remains 85 /100 variables (removed 15) and now considering 108/131 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 85/100 places, 108/131 transitions.
// Phase 1: matrix 108 rows 85 cols
[2025-05-30 10:46:53] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229600 resets) in 1144 ms. (873 steps per ms)
BEST_FIRST walk for 1000000 steps (98309 resets) in 516 ms. (1934 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:46:55] [INFO ] Invariant cache hit.
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-30 10:46:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:46:55] [INFO ] [Real]Added 36 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:46:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:46:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-30 10:46:55] [INFO ] [Nat]Added 36 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:46:55] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 14 ms.
[2025-05-30 10:46:55] [INFO ] Added : 12 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-30 10:46:55] [INFO ] Invariant cache hit.
[2025-05-30 10:46:55] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-30 10:46:55] [INFO ] Invariant cache hit.
[2025-05-30 10:46:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:46:56] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2025-05-30 10:46:56] [INFO ] Redundant transitions in 4 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-30 10:46:56] [INFO ] Invariant cache hit.
[2025-05-30 10:46:56] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/193 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-05-30 10:46:59] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 124 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5415 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/193 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 107/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 231 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6748 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 12337ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 12340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12886 ms. Remains : 85/85 places, 108/108 transitions.
[2025-05-30 10:47:08] [INFO ] Flatten gal took : 13 ms
[2025-05-30 10:47:08] [INFO ] Flatten gal took : 12 ms
RANDOM walk for 40000 steps (9264 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2025-05-30 10:47:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9616901046099566634.gal : 3 ms
[2025-05-30 10:47:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15987337516937669904.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/ReachabilityCardinality9616901046099566634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15987337516937669904.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/ReachabilityCardinality15987337516937669904.prop.
BEST_FIRST walk for 40001 steps (3941 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 224
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 422
BEST_FIRST walk for 40003 steps (3859 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :422 after 794
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :794 after 3040
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3040 after 11754
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :11754 after 28357
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :28357 after 125015
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :125015 after 386841
Interrupted probabilistic random walk after 2887109 steps, run timeout after 3001 ms. (steps per millisecond=962 ) properties seen :1 out of 2
Probabilistic random walk after 2887109 steps, saw 1137422 distinct states, run finished after 3001 ms. (steps per millisecond=962 ) properties seen :1
[2025-05-30 10:47:11] [INFO ] Invariant cache hit.
[2025-05-30 10:47:11] [INFO ] State equation strengthened by 36 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/137 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 184/193 variables, and 82 constraints, problems are : Problem set: 1 solved, 0 unsolved in 105 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/85 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-05 in 18724 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-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:[11]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[11]
// Phase 1: matrix 131 rows 100 cols
[2025-05-30 10:47:11] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[11]
RANDOM walk for 10000 steps (2321 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (973 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[11]
[2025-05-30 10:47:11] [INFO ] Invariant cache hit.
[2025-05-30 10:47:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:11] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-05-30 10:47:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 10:47:11] [INFO ] [Real]Added 45 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:47:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-05-30 10:47:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:47:12] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 14 ms.
[2025-05-30 10:47:12] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2025-05-30 10:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-05-30 10:47:12] [INFO ] Added : 10 causal constraints over 4 iterations in 213 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[11]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[11]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 131/131 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 96 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 96 transition count 127
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 92 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 92 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 92 transition count 122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 89 transition count 116
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 89 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 89 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 86 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 86 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 84 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 84 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 84 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 83 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 83 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 82 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 82 transition count 99
Applied a total of 41 rules in 19 ms. Remains 82 /100 variables (removed 18) and now considering 99/131 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 82/100 places, 99/131 transitions.
// Phase 1: matrix 99 rows 82 cols
[2025-05-30 10:47:12] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[11]
RANDOM walk for 1000000 steps (229691 resets) in 1103 ms. (905 steps per ms)
BEST_FIRST walk for 1000001 steps (98470 resets) in 651 ms. (1533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[11]
[2025-05-30 10:47:14] [INFO ] Invariant cache hit.
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-05-30 10:47:14] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-30 10:47:14] [INFO ] [Real]Added 29 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:47:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-05-30 10:47:14] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2025-05-30 10:47:14] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 8 ms.
[2025-05-30 10:47:14] [INFO ] Added : 5 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[11]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[11]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-05-30 10:47:14] [INFO ] Invariant cache hit.
[2025-05-30 10:47:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-05-30 10:47:14] [INFO ] Invariant cache hit.
[2025-05-30 10:47:14] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-30 10:47:14] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2025-05-30 10:47:14] [INFO ] Redundant transitions in 3 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-30 10:47:14] [INFO ] Invariant cache hit.
[2025-05-30 10:47:14] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2759 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3958 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 6869ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7221 ms. Remains : 82/82 places, 99/99 transitions.
[2025-05-30 10:47:21] [INFO ] Flatten gal took : 59 ms
[2025-05-30 10:47:21] [INFO ] Flatten gal took : 11 ms
[2025-05-30 10:47:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1778272942511459029.gal : 13 ms
[2025-05-30 10:47:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13878451312028956235.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/ReachabilityCardinality1778272942511459029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13878451312028956235.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/ReachabilityCardinality13878451312028956235.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
RANDOM walk for 40000 steps (9184 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 224
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 374
BEST_FIRST walk for 40003 steps (3966 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :374 after 726
BEST_FIRST walk for 40001 steps (3906 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :726 after 1954
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1954 after 11724
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :11724 after 38988
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :38988 after 402956
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :402956 after 804537
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :804537 after 3.99552e+06
Interrupted probabilistic random walk after 2575954 steps, run timeout after 3001 ms. (steps per millisecond=858 ) properties seen :1 out of 2
Probabilistic random walk after 2575954 steps, saw 1042286 distinct states, run finished after 3001 ms. (steps per millisecond=858 ) properties seen :1
[2025-05-30 10:47:25] [INFO ] Invariant cache hit.
[2025-05-30 10:47:25] [INFO ] State equation strengthened by 29 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 172/181 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 115 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/82 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[0] Max Struct:[11]
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-07 in 13414 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12
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:[9]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[9]
// Phase 1: matrix 131 rows 100 cols
[2025-05-30 10:47:25] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2314 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1016 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2025-05-30 10:47:25] [INFO ] Invariant cache hit.
[2025-05-30 10:47:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:25] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-05-30 10:47:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 10:47:25] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:47:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:25] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-30 10:47:25] [INFO ] [Nat]Added 45 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:47:25] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 9 ms.
[2025-05-30 10:47:25] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 3 ms to minimize.
[2025-05-30 10:47:25] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 3 ms to minimize.
[2025-05-30 10:47:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2025-05-30 10:47:25] [INFO ] Added : 10 causal constraints over 3 iterations in 222 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 131/131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 94 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 94 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 94 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 92 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 92 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 90 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 90 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 89 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 88 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 87 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 87 transition count 108
Applied a total of 28 rules in 17 ms. Remains 87 /100 variables (removed 13) and now considering 108/131 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 87/100 places, 108/131 transitions.
// Phase 1: matrix 108 rows 87 cols
[2025-05-30 10:47:25] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 1000000 steps (229670 resets) in 937 ms. (1066 steps per ms)
BEST_FIRST walk for 1000001 steps (98239 resets) in 468 ms. (2132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2025-05-30 10:47:27] [INFO ] Invariant cache hit.
[2025-05-30 10:47:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-30 10:47:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 10:47:27] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:47:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-05-30 10:47:27] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:47:27] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 11 ms.
[2025-05-30 10:47:27] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2025-05-30 10:47:27] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2025-05-30 10:47:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2025-05-30 10:47:28] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 4 ms to minimize.
[2025-05-30 10:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-05-30 10:47:28] [INFO ] Added : 14 causal constraints over 5 iterations in 409 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-30 10:47:28] [INFO ] Invariant cache hit.
[2025-05-30 10:47:28] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-30 10:47:28] [INFO ] Invariant cache hit.
[2025-05-30 10:47:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 10:47:28] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2025-05-30 10:47:28] [INFO ] Redundant transitions in 5 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-30 10:47:28] [INFO ] Invariant cache hit.
[2025-05-30 10:47:28] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 121 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3118 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 107/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8139 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 11459ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 11462ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12093 ms. Remains : 87/87 places, 108/108 transitions.
[2025-05-30 10:47:40] [INFO ] Flatten gal took : 10 ms
[2025-05-30 10:47:40] [INFO ] Flatten gal took : 9 ms
[2025-05-30 10:47:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5458436440058663707.gal : 3 ms
[2025-05-30 10:47:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10593150331511513419.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/ReachabilityCardinality5458436440058663707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10593150331511513419.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
RANDOM walk for 40000 steps (9250 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10593150331511513419.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 224
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 374
BEST_FIRST walk for 40003 steps (3920 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :374 after 702
BEST_FIRST walk for 40002 steps (3854 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :702 after 1838
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1838 after 27593
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :27593 after 75137
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :75137 after 230001
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :230001 after 631398
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :631398 after 4.32798e+06
Interrupted probabilistic random walk after 2476331 steps, run timeout after 3001 ms. (steps per millisecond=825 ) properties seen :1 out of 2
Probabilistic random walk after 2476331 steps, saw 1005604 distinct states, run finished after 3001 ms. (steps per millisecond=825 ) properties seen :1
[2025-05-30 10:47:43] [INFO ] Invariant cache hit.
[2025-05-30 10:47:43] [INFO ] State equation strengthened by 32 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/88 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/142 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/149 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 46/195 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 25/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 10:47:43] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 195/195 variables, and 122 constraints, problems are : Problem set: 1 solved, 0 unsolved in 201 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 209ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[0] Max Struct:[9]
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12 in 18465 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-15
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:[9]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[9]
// Phase 1: matrix 131 rows 100 cols
[2025-05-30 10:47:43] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2272 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1045 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2025-05-30 10:47:43] [INFO ] Invariant cache hit.
[2025-05-30 10:47:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:43] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-30 10:47:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 10:47:43] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:47:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:43] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-05-30 10:47:43] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:47:43] [INFO ] Computed and/alt/rep : 35/82/35 causal constraints (skipped 95 transitions) in 10 ms.
[2025-05-30 10:47:43] [INFO ] Added : 11 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 131/131 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 94 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 94 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 94 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 92 transition count 119
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 92 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 92 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 90 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 90 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 88 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 88 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 87 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 86 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 86 transition count 109
Applied a total of 32 rules in 20 ms. Remains 86 /100 variables (removed 14) and now considering 109/131 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 86/100 places, 109/131 transitions.
// Phase 1: matrix 109 rows 86 cols
[2025-05-30 10:47:44] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 1000000 steps (229572 resets) in 953 ms. (1048 steps per ms)
BEST_FIRST walk for 1000000 steps (98312 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2025-05-30 10:47:45] [INFO ] Invariant cache hit.
[2025-05-30 10:47:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:47:45] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-05-30 10:47:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 10:47:45] [INFO ] [Real]Added 37 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:47:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:47:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:47:45] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-30 10:47:45] [INFO ] [Nat]Added 37 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:47:45] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 78 transitions) in 10 ms.
[2025-05-30 10:47:45] [INFO ] Added : 11 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 86/86 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-05-30 10:47:45] [INFO ] Invariant cache hit.
[2025-05-30 10:47:45] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 10:47:45] [INFO ] Invariant cache hit.
[2025-05-30 10:47:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 10:47:46] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2025-05-30 10:47:46] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-05-30 10:47:46] [INFO ] Invariant cache hit.
[2025-05-30 10:47:46] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 125 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4111 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 233 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6959 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11259ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11261ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11646 ms. Remains : 86/86 places, 109/109 transitions.
[2025-05-30 10:47:57] [INFO ] Flatten gal took : 9 ms
[2025-05-30 10:47:57] [INFO ] Flatten gal took : 10 ms
[2025-05-30 10:47:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12597311793134815273.gal : 3 ms
[2025-05-30 10:47:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15576872139135089051.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/ReachabilityCardinality12597311793134815273.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15576872139135089051.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/ReachabilityCardinality15576872139135089051.prop.
RANDOM walk for 40000 steps (9127 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 224
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 422
BEST_FIRST walk for 40002 steps (3975 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :422 after 818
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :818 after 3594
BEST_FIRST walk for 40002 steps (3989 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3594 after 21654
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :21654 after 53177
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :53177 after 272168
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :272168 after 715844
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :715844 after 1.91833e+06
Interrupted probabilistic random walk after 1947955 steps, run timeout after 3011 ms. (steps per millisecond=646 ) properties seen :1 out of 2
Probabilistic random walk after 1947955 steps, saw 779980 distinct states, run finished after 3011 ms. (steps per millisecond=646 ) properties seen :1
[2025-05-30 10:48:00] [INFO ] Invariant cache hit.
[2025-05-30 10:48:00] [INFO ] State equation strengthened by 37 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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/139 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 186/195 variables, and 83 constraints, problems are : Problem set: 1 solved, 0 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/86 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[0] Max Struct:[9]
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-15 in 17231 ms.
[2025-05-30 10:48:00] [INFO ] Flatten gal took : 10 ms
[2025-05-30 10:48:00] [INFO ] Applying decomposition
[2025-05-30 10:48:00] [INFO ] Flatten gal took : 9 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/graph11932515470703325107.txt' '-o' '/tmp/graph11932515470703325107.bin' '-w' '/tmp/graph11932515470703325107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11932515470703325107.bin' '-l' '-1' '-v' '-w' '/tmp/graph11932515470703325107.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:48:01] [INFO ] Decomposing Gal with order
[2025-05-30 10:48:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:48:01] [INFO ] Removed a total of 128 redundant transitions.
[2025-05-30 10:48:01] [INFO ] Flatten gal took : 63 ms
[2025-05-30 10:48:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 17 ms.
[2025-05-30 10:48:01] [INFO ] Time to serialize gal into /tmp/UpperBounds3760339910676911360.gal : 5 ms
[2025-05-30 10:48:01] [INFO ] Time to serialize properties into /tmp/UpperBounds7140881259870199118.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/UpperBounds3760339910676911360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7140881259870199118.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 ...283
Loading property file /tmp/UpperBounds7140881259870199118.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.41894e+08,63.6174,594412,5606,1951,474280,37318,409,2.67668e+06,146,824159,0
Total reachable state count : 141894070

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m09-UpperBounds-03 :0 <= i4.u11.l463 <= 1
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m09-UpperBounds-03,0,65.9277,594412,1,0,474280,37318,503,2.67668e+06,170,824159,3476
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m09-UpperBounds-05 :0 <= i4.u12.p46 <= 1
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m09-UpperBounds-05,0,65.9874,594412,1,0,474280,37318,526,2.67668e+06,180,824159,4818
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d1m09-UpperBounds-07 :0 <= i5.u0.l531 <= 3
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-07 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m09-UpperBounds-07,0,66.2182,594412,1,0,474280,37318,554,2.67668e+06,191,824159,6303
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property DBSingleClientW-PT-d1m09-UpperBounds-12 :0 <= i2.u6.l1294 <= 6
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-12 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m09-UpperBounds-12,0,66.2241,594412,1,0,474280,37318,572,2.67668e+06,194,824159,6522
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m09-UpperBounds-15 :0 <= i4.u3.l406 <= 1
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m09-UpperBounds-15,0,66.2608,594412,1,0,474280,37318,591,2.67668e+06,221,824159,8094
Total runtime 195601 ms.

BK_STOP 1748602147661

--------------------
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="DBSingleClientW-PT-d1m09"
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 DBSingleClientW-PT-d1m09, 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-174854075800013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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