Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189500565.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717190687846

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:24:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:24:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:24:49] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-31 21:24:49] [INFO ] Transformed 4763 places.
[2024-05-31 21:24:49] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:24:49] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 3580 places in 34 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:24:49] [INFO ] Computed 6 invariants in 174 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 7, 6]
RANDOM walk for 10000 steps (2320 resets) in 358 ms. (27 steps per ms)
BEST_FIRST walk for 40002 steps (3853 resets) in 286 ms. (139 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 7, 6]
[2024-05-31 21:24:50] [INFO ] Invariant cache hit.
[2024-05-31 21:24:50] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-31 21:24:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-31 21:24:51] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2024-05-31 21:24:52] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-31 21:24:52] [INFO ] [Real]Added 1588 Read/Feed constraints in 883 ms returned sat
[2024-05-31 21:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-31 21:24:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:24:53] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2024-05-31 21:24:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 699 ms returned sat
[2024-05-31 21:24:55] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 709 ms.
[2024-05-31 21:24:55] [INFO ] Added : 2 causal constraints over 1 iterations in 1035 ms. Result :sat
Minimization took 631 ms.
[2024-05-31 21:24:56] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:24:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:24:57] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-05-31 21:24:58] [INFO ] [Real]Added 1588 Read/Feed constraints in 719 ms returned sat
[2024-05-31 21:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-31 21:24:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:24:58] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2024-05-31 21:24:59] [INFO ] [Nat]Added 1588 Read/Feed constraints in 648 ms returned sat
[2024-05-31 21:25:00] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 644 ms.
[2024-05-31 21:25:00] [INFO ] Added : 6 causal constraints over 2 iterations in 1027 ms. Result :sat
Minimization took 615 ms.
[2024-05-31 21:25:01] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 21:25:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:25:02] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2024-05-31 21:25:02] [INFO ] [Real]Added 1588 Read/Feed constraints in 779 ms returned sat
[2024-05-31 21:25:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:25:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:25:03] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2024-05-31 21:25:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 737 ms returned sat
[2024-05-31 21:25:05] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 414 ms.
[2024-05-31 21:25:05] [INFO ] Added : 10 causal constraints over 2 iterations in 882 ms. Result :sat
Minimization took 630 ms.
[2024-05-31 21:25:06] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 21:25:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:25:07] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-05-31 21:25:07] [INFO ] [Real]Added 1588 Read/Feed constraints in 724 ms returned sat
[2024-05-31 21:25:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:25:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-31 21:25:08] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2024-05-31 21:25:09] [INFO ] [Nat]Added 1588 Read/Feed constraints in 940 ms returned sat
[2024-05-31 21:25:10] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 384 ms.
[2024-05-31 21:25:11] [INFO ] Deduced a trap composed of 33 places in 957 ms of which 133 ms to minimize.
[2024-05-31 21:25:12] [INFO ] Deduced a trap composed of 48 places in 853 ms of which 8 ms to minimize.
[2024-05-31 21:25:12] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2257 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 7, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 7, 6]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.9 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 607 place count 747 transition count 1202
Iterating global reduction 1 with 389 rules applied. Total rules applied 996 place count 747 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 747 transition count 1193
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1317 place count 435 transition count 881
Iterating global reduction 2 with 312 rules applied. Total rules applied 1629 place count 435 transition count 881
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1641 place count 435 transition count 869
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1880 place count 196 transition count 535
Iterating global reduction 3 with 239 rules applied. Total rules applied 2119 place count 196 transition count 535
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2329 place count 196 transition count 325
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2352 place count 173 transition count 287
Iterating global reduction 4 with 23 rules applied. Total rules applied 2375 place count 173 transition count 287
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2381 place count 173 transition count 281
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2396 place count 158 transition count 266
Iterating global reduction 5 with 15 rules applied. Total rules applied 2411 place count 158 transition count 266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2414 place count 158 transition count 263
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2427 place count 145 transition count 250
Iterating global reduction 6 with 13 rules applied. Total rules applied 2440 place count 145 transition count 250
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2450 place count 145 transition count 240
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2455 place count 140 transition count 216
Iterating global reduction 7 with 5 rules applied. Total rules applied 2460 place count 140 transition count 216
Applied a total of 2460 rules in 238 ms. Remains 140 /1183 variables (removed 1043) and now considering 216/2478 (removed 2262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 140/1183 places, 216/2478 transitions.
// Phase 1: matrix 216 rows 140 cols
[2024-05-31 21:25:13] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 7, 6]
RANDOM walk for 1000000 steps (229849 resets) in 2537 ms. (394 steps per ms)
BEST_FIRST walk for 4000003 steps (381725 resets) in 4361 ms. (917 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[6, 6, 7, 6]
[2024-05-31 21:25:20] [INFO ] Invariant cache hit.
[2024-05-31 21:25:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:20] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2024-05-31 21:25:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:25:20] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 21:25:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:25:20] [INFO ] [Real]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:25:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:20] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:25:20] [INFO ] [Nat]Added 79 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:25:20] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 160 transitions) in 17 ms.
[2024-05-31 21:25:20] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-31 21:25:20] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-31 21:25:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2024-05-31 21:25:20] [INFO ] Added : 14 causal constraints over 3 iterations in 336 ms. Result :sat
Minimization took 194 ms.
[2024-05-31 21:25:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Real]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Nat]Added 79 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:25:21] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 160 transitions) in 14 ms.
[2024-05-31 21:25:21] [INFO ] Added : 10 causal constraints over 2 iterations in 58 ms. Result :sat
Minimization took 139 ms.
[2024-05-31 21:25:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Real]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:25:21] [INFO ] [Nat]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:25:21] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-31 21:25:21] [INFO ] Added : 12 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 6, 7, 6]
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 139 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 215
Applied a total of 2 rules in 19 ms. Remains 139 /140 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 139/140 places, 215/216 transitions.
// Phase 1: matrix 215 rows 139 cols
[2024-05-31 21:25:22] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
RANDOM walk for 1000000 steps (230159 resets) in 2396 ms. (417 steps per ms)
BEST_FIRST walk for 3000002 steps (286388 resets) in 3231 ms. (928 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
[2024-05-31 21:25:27] [INFO ] Invariant cache hit.
[2024-05-31 21:25:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:25:27] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:25:27] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:25:27] [INFO ] [Real]Added 79 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:27] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:25:27] [INFO ] [Nat]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:25:27] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 16 ms.
[2024-05-31 21:25:28] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-31 21:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-31 21:25:28] [INFO ] Added : 16 causal constraints over 4 iterations in 211 ms. Result :sat
Minimization took 191 ms.
[2024-05-31 21:25:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:28] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:25:28] [INFO ] [Real]Added 79 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:25:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:28] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:25:28] [INFO ] [Nat]Added 79 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:25:28] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 22 ms.
[2024-05-31 21:25:28] [INFO ] Added : 15 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 151 ms.
[2024-05-31 21:25:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:28] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:25:28] [INFO ] [Real]Added 79 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:25:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:28] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:25:29] [INFO ] [Nat]Added 79 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:25:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 17 ms.
[2024-05-31 21:25:29] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:25:29] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-31 21:25:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2024-05-31 21:25:29] [INFO ] Added : 23 causal constraints over 6 iterations in 332 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Applied a total of 0 rules in 8 ms. Remains 139 /139 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 139/139 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 21:25:29] [INFO ] Invariant cache hit.
[2024-05-31 21:25:29] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 21:25:29] [INFO ] Invariant cache hit.
[2024-05-31 21:25:29] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:25:30] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-31 21:25:30] [INFO ] Redundant transitions in 11 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 21:25:30] [INFO ] Invariant cache hit.
[2024-05-31 21:25:30] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/354 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 220 constraints, problems are : Problem set: 0 solved, 214 unsolved in 7701 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/354 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 214/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 434 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15407 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 23528ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 23545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24137 ms. Remains : 139/139 places, 215/215 transitions.
RANDOM walk for 40000 steps (9272 resets) in 1114 ms. (35 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3836 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3870 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3835 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3918 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3884 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3837 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 825728 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :3 out of 6
Probabilistic random walk after 825728 steps, saw 322356 distinct states, run finished after 3004 ms. (steps per millisecond=274 ) properties seen :3
[2024-05-31 21:25:57] [INFO ] Invariant cache hit.
[2024-05-31 21:25:57] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 149/249 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 7 (OVERLAPS) 98/347 variables, 35/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 76/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/354 variables, 4/217 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 3/220 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-31 21:25:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 354/354 variables, and 221 constraints, problems are : Problem set: 3 solved, 0 unsolved in 253 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 263ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[6, 7, 6]
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:25:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2267 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (944 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:25:58] [INFO ] Invariant cache hit.
[2024-05-31 21:25:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:58] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:25:58] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:25:58] [INFO ] [Real]Added 79 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:58] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:25:58] [INFO ] [Nat]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:25:58] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 15 ms.
[2024-05-31 21:25:58] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-31 21:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-31 21:25:58] [INFO ] Added : 16 causal constraints over 4 iterations in 201 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 134 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 134 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 133 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 132 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 131 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 128 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 128 transition count 178
Applied a total of 28 rules in 34 ms. Remains 128 /139 variables (removed 11) and now considering 178/215 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 128/139 places, 178/215 transitions.
// Phase 1: matrix 178 rows 128 cols
[2024-05-31 21:25:58] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229893 resets) in 2204 ms. (453 steps per ms)
BEST_FIRST walk for 1000000 steps (95270 resets) in 972 ms. (1027 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:26:02] [INFO ] Invariant cache hit.
[2024-05-31 21:26:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:26:02] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 21:26:02] [INFO ] [Real]Added 51 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:26:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:26:02] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:26:02] [INFO ] [Nat]Added 51 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:26:02] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 12 ms.
[2024-05-31 21:26:02] [INFO ] Added : 18 causal constraints over 4 iterations in 90 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-31 21:26:02] [INFO ] Invariant cache hit.
[2024-05-31 21:26:02] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-31 21:26:02] [INFO ] Invariant cache hit.
[2024-05-31 21:26:02] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 21:26:02] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-31 21:26:02] [INFO ] Redundant transitions in 6 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-31 21:26:02] [INFO ] Invariant cache hit.
[2024-05-31 21:26:02] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 51/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 181 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4784 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 51/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 358 constraints, problems are : Problem set: 0 solved, 177 unsolved in 11899 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 16966ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 16969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17425 ms. Remains : 128/128 places, 178/178 transitions.
RANDOM walk for 40000 steps (9125 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3802 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3797 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1765302 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :1 out of 2
Probabilistic random walk after 1765302 steps, saw 720978 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :1
[2024-05-31 21:26:23] [INFO ] Invariant cache hit.
[2024-05-31 21:26:23] [INFO ] State equation strengthened by 51 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) 138/141 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/217 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/232 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/306 variables, 57/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:26:23] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 306/306 variables, and 182 constraints, problems are : Problem set: 1 solved, 0 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 180ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04 in 25159 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 215 rows 139 cols
[2024-05-31 21:26:23] [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 (2291 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10000 steps (956 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:26:23] [INFO ] Invariant cache hit.
[2024-05-31 21:26:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:23] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-31 21:26:23] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:26:23] [INFO ] [Real]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:26:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:23] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:26:23] [INFO ] [Nat]Added 79 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:26:23] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 14 ms.
[2024-05-31 21:26:23] [INFO ] Added : 15 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 139 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 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 133 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 133 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 131 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 131 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 129 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 129 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 129 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 128 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 128 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 128 transition count 193
Applied a total of 26 rules in 30 ms. Remains 128 /139 variables (removed 11) and now considering 193/215 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 128/139 places, 193/215 transitions.
// Phase 1: matrix 193 rows 128 cols
[2024-05-31 21:26:23] [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 (229689 resets) in 2231 ms. (448 steps per ms)
BEST_FIRST walk for 1000000 steps (95261 resets) in 1006 ms. (993 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:26:27] [INFO ] Invariant cache hit.
[2024-05-31 21:26:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:27] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:26:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 21:26:27] [INFO ] [Real]Added 72 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:26:27] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:26:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:26:27] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 142 transitions) in 15 ms.
[2024-05-31 21:26:27] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:26:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-31 21:26:27] [INFO ] Added : 19 causal constraints over 4 iterations in 188 ms. Result :sat
Minimization took 103 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 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/128 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-05-31 21:26:27] [INFO ] Invariant cache hit.
[2024-05-31 21:26:27] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 21:26:27] [INFO ] Invariant cache hit.
[2024-05-31 21:26:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 21:26:27] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-31 21:26:27] [INFO ] Redundant transitions in 3 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-31 21:26:27] [INFO ] Invariant cache hit.
[2024-05-31 21:26:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 202 constraints, problems are : Problem set: 0 solved, 192 unsolved in 5458 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 192/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 394 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11111 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 16836ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 16839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17229 ms. Remains : 128/128 places, 193/193 transitions.
RANDOM walk for 40000 steps (9213 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3697 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3899 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1695357 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :1 out of 2
Probabilistic random walk after 1695357 steps, saw 701095 distinct states, run finished after 3001 ms. (steps per millisecond=564 ) properties seen :1
[2024-05-31 21:26:47] [INFO ] Invariant cache hit.
[2024-05-31 21:26:47] [INFO ] State equation strengthened by 72 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) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/220 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 312/321 variables, and 125 constraints, problems are : Problem set: 1 solved, 0 unsolved in 96 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/128 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-07 in 24850 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 215 rows 139 cols
[2024-05-31 21:26:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2273 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (991 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:26:48] [INFO ] Invariant cache hit.
[2024-05-31 21:26:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:48] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:26:48] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:26:48] [INFO ] [Real]Added 79 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:26:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:26:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:26:48] [INFO ] [Nat]Added 79 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:26:48] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 15 ms.
[2024-05-31 21:26:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:26:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-31 21:26:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2024-05-31 21:26:48] [INFO ] Added : 23 causal constraints over 6 iterations in 322 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 134 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 134 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 133 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 132 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 132 transition count 201
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 132 transition count 200
Applied a total of 18 rules in 33 ms. Remains 132 /139 variables (removed 7) and now considering 200/215 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 132/139 places, 200/215 transitions.
// Phase 1: matrix 200 rows 132 cols
[2024-05-31 21:26:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229894 resets) in 2300 ms. (434 steps per ms)
BEST_FIRST walk for 1000000 steps (95393 resets) in 1026 ms. (973 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:26:52] [INFO ] Invariant cache hit.
[2024-05-31 21:26:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:52] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-31 21:26:52] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:26:52] [INFO ] [Real]Added 74 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:52] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:26:52] [INFO ] [Nat]Added 74 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:26:52] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 148 transitions) in 13 ms.
[2024-05-31 21:26:52] [INFO ] Added : 12 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 132/132 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-31 21:26:52] [INFO ] Invariant cache hit.
[2024-05-31 21:26:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:26:52] [INFO ] Invariant cache hit.
[2024-05-31 21:26:52] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:26:53] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-31 21:26:53] [INFO ] Redundant transitions in 2 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-31 21:26:53] [INFO ] Invariant cache hit.
[2024-05-31 21:26:53] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/332 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 74/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 208 constraints, problems are : Problem set: 0 solved, 199 unsolved in 6368 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 132/132 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/332 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 74/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 199/407 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/332 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 407 constraints, problems are : Problem set: 0 solved, 199 unsolved in 15533 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 132/132 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 22156ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 22158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22616 ms. Remains : 132/132 places, 200/200 transitions.
RANDOM walk for 40000 steps (9148 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3812 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3783 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1693485 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :1 out of 2
Probabilistic random walk after 1693485 steps, saw 692604 distinct states, run finished after 3001 ms. (steps per millisecond=564 ) properties seen :1
[2024-05-31 21:27:18] [INFO ] Invariant cache hit.
[2024-05-31 21:27:18] [INFO ] State equation strengthened by 74 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) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 137/231 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 323/332 variables, and 129 constraints, problems are : Problem set: 1 solved, 0 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/132 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14 in 30492 ms.
[2024-05-31 21:27:18] [INFO ] Flatten gal took : 66 ms
[2024-05-31 21:27:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-31 21:27:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 139 places, 215 transitions and 849 arcs took 5 ms.
Total runtime 149577 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d2m06-UpperBounds-04
Could not compute solution for formula : DBSingleClientW-PT-d2m06-UpperBounds-07
Could not compute solution for formula : DBSingleClientW-PT-d2m06-UpperBounds-14

BK_STOP 1717190839101

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DBSingleClientW-PT-d2m06-UpperBounds-04
ub formula formula --maxsum=/tmp/753/ub_0_
ub formula name DBSingleClientW-PT-d2m06-UpperBounds-07
ub formula formula --maxsum=/tmp/753/ub_1_
ub formula name DBSingleClientW-PT-d2m06-UpperBounds-14
ub formula formula --maxsum=/tmp/753/ub_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d2m06, 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 r480-tall-171624189500565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m06.tgz
mv DBSingleClientW-PT-d2m06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;