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-171624189400485.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-d0m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189400485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 119K 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-d0m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717189147723

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-d0m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:59:09] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-31 20:59:09] [INFO ] Transformed 553 places.
[2024-05-31 20:59:09] [INFO ] Transformed 150 transitions.
[2024-05-31 20:59:09] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 150 rows 109 cols
[2024-05-31 20:59:09] [INFO ] Computed 6 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2311 resets) in 59 ms. (166 steps per ms)
BEST_FIRST walk for 10001 steps (1043 resets) in 33 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2024-05-31 20:59:09] [INFO ] Invariant cache hit.
[2024-05-31 20:59:09] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-31 20:59:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-31 20:59:09] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 20:59:09] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 20:59:09] [INFO ] [Real]Added 74 Read/Feed constraints in 16 ms returned sat
[2024-05-31 20:59:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:59:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 20:59:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-31 20:59:10] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 20:59:10] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:59:10] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 25 ms.
[2024-05-31 20:59:10] [INFO ] Added : 2 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[5]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 62 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 61 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 60 transition count 70
Applied a total of 102 rules in 155 ms. Remains 60 /109 variables (removed 49) and now considering 70/150 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 60/109 places, 70/150 transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-31 20:59:10] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5]
RANDOM walk for 1000000 steps (229100 resets) in 1950 ms. (512 steps per ms)
BEST_FIRST walk for 1000001 steps (101380 resets) in 883 ms. (1131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[5]
[2024-05-31 20:59:13] [INFO ] Invariant cache hit.
[2024-05-31 20:59:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:59:13] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:59:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:13] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:59:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:59:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:59:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 20:59:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:59:13] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 7 ms.
[2024-05-31 20:59:13] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-31 20:59:13] [INFO ] Invariant cache hit.
[2024-05-31 20:59:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 20:59:13] [INFO ] Invariant cache hit.
[2024-05-31 20:59:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:13] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-31 20:59:13] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-31 20:59:13] [INFO ] Invariant cache hit.
[2024-05-31 20:59:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1006 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1972 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 3089ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3290 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-31 20:59:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[5]
RANDOM walk for 1000000 steps (229342 resets) in 1661 ms. (601 steps per ms)
BEST_FIRST walk for 1000000 steps (100810 resets) in 792 ms. (1261 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[5]
[2024-05-31 20:59:19] [INFO ] Invariant cache hit.
[2024-05-31 20:59:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:59:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:19] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:59:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:59:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 20:59:19] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:59:19] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 6 ms.
[2024-05-31 20:59:19] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-31 20:59:19] [INFO ] Invariant cache hit.
[2024-05-31 20:59:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 20:59:19] [INFO ] Invariant cache hit.
[2024-05-31 20:59:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:19] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-31 20:59:19] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-31 20:59:19] [INFO ] Invariant cache hit.
[2024-05-31 20:59:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 903 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1952 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2911ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2913ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3061 ms. Remains : 60/60 places, 70/70 transitions.
RANDOM walk for 40000 steps (9128 resets) in 611 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4100 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4048 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1520004 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :1 out of 2
Probabilistic random walk after 1520004 steps, saw 581590 distinct states, run finished after 3007 ms. (steps per millisecond=505 ) properties seen :1
[2024-05-31 20:59:25] [INFO ] Invariant cache hit.
[2024-05-31 20:59:25] [INFO ] State equation strengthened by 20 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) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/130 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Int declared 130/130 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 54 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms 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:[2] Max Struct:[5]
Starting property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
[2024-05-31 20:59:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2321 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10000 steps (1028 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2024-05-31 20:59:25] [INFO ] Invariant cache hit.
[2024-05-31 20:59:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:59:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:25] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:59:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:59:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 20:59:25] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 20:59:25] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:59:26] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 7 ms.
[2024-05-31 20:59:26] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-31 20:59:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5]
RANDOM walk for 1000000 steps (229010 resets) in 1684 ms. (593 steps per ms)
BEST_FIRST walk for 1000001 steps (101314 resets) in 815 ms. (1225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[5]
[2024-05-31 20:59:28] [INFO ] Invariant cache hit.
[2024-05-31 20:59:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:28] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 20:59:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:28] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:59:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:59:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 20:59:28] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:59:28] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 5 ms.
[2024-05-31 20:59:28] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-31 20:59:28] [INFO ] Invariant cache hit.
[2024-05-31 20:59:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 20:59:28] [INFO ] Invariant cache hit.
[2024-05-31 20:59:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-31 20:59:28] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-31 20:59:28] [INFO ] Invariant cache hit.
[2024-05-31 20:59:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 939 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1757 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2753ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2754ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2937 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-31 20:59:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[5]
RANDOM walk for 1000000 steps (228826 resets) in 1666 ms. (599 steps per ms)
BEST_FIRST walk for 1000001 steps (101029 resets) in 781 ms. (1278 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[5]
[2024-05-31 20:59:34] [INFO ] Invariant cache hit.
[2024-05-31 20:59:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 20:59:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:34] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:59:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:59:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 20:59:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:59:34] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 6 ms.
[2024-05-31 20:59:34] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-31 20:59:34] [INFO ] Invariant cache hit.
[2024-05-31 20:59:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 20:59:34] [INFO ] Invariant cache hit.
[2024-05-31 20:59:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:34] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-31 20:59:34] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-31 20:59:34] [INFO ] Invariant cache hit.
[2024-05-31 20:59:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 963 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1850 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2868ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2876ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3030 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-31 20:59:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[5]
RANDOM walk for 1000000 steps (229240 resets) in 1679 ms. (595 steps per ms)
BEST_FIRST walk for 1000000 steps (101013 resets) in 800 ms. (1248 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[5]
[2024-05-31 20:59:39] [INFO ] Invariant cache hit.
[2024-05-31 20:59:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:59:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:39] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:59:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:39] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 20:59:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:59:39] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 7 ms.
[2024-05-31 20:59:39] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-31 20:59:39] [INFO ] Invariant cache hit.
[2024-05-31 20:59:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 20:59:39] [INFO ] Invariant cache hit.
[2024-05-31 20:59:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:40] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-31 20:59:40] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-31 20:59:40] [INFO ] Invariant cache hit.
[2024-05-31 20:59:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 975 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1912 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2932ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3083 ms. Remains : 60/60 places, 70/70 transitions.
RANDOM walk for 40000 steps (9198 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4062 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4130 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1050173 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 2
Probabilistic random walk after 1050173 steps, saw 402898 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
[2024-05-31 20:59:46] [INFO ] Invariant cache hit.
[2024-05-31 20:59:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/130 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 11 (OVERLAPS) 9/130 variables, 5/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 4/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/130 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 84 constraints, problems are : Problem set: 1 solved, 1 unsolved in 73 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 60/60 places, 70/70 transitions.
RANDOM walk for 40000 steps (9056 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4080 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2547463 steps, run timeout after 3001 ms. (steps per millisecond=848 ) properties seen :0 out of 1
Probabilistic random walk after 2547463 steps, saw 945242 distinct states, run finished after 3001 ms. (steps per millisecond=848 ) properties seen :0
[2024-05-31 20:59:49] [INFO ] Invariant cache hit.
[2024-05-31 20:59:49] [INFO ] State equation strengthened by 20 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) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/130 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/130 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/130 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-31 20:59:49] [INFO ] Invariant cache hit.
[2024-05-31 20:59:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 20:59:49] [INFO ] Invariant cache hit.
[2024-05-31 20:59:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:59:49] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-31 20:59:49] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-31 20:59:49] [INFO ] Invariant cache hit.
[2024-05-31 20:59:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 942 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1971 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2968ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3105 ms. Remains : 60/60 places, 70/70 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 60 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 59 transition count 65
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 59 transition count 58
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 52 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 51 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 51 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 50 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 50 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 49 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 47 transition count 67
Applied a total of 30 rules in 17 ms. Remains 47 /60 variables (removed 13) and now considering 67/70 (removed 3) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 47 cols
[2024-05-31 20:59:52] [INFO ] Computed 6 invariants in 4 ms
[2024-05-31 20:59:52] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 20:59:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-31 20:59:52] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:59:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 20:59:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-31 20:59:52] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:59:52] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 16 ms to minimize.
[2024-05-31 20:59:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
TRAPS : Iteration 1
[2024-05-31 20:59:52] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:59:52] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 232 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13 in 27014 ms.
[2024-05-31 20:59:53] [INFO ] Flatten gal took : 28 ms
[2024-05-31 20:59:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 20:59:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 70 transitions and 276 arcs took 3 ms.
Total runtime 43994 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-d0m10-UpperBounds-13

BK_STOP 1717189193300

--------------------
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-d0m10-UpperBounds-13
ub formula formula --maxsum=/tmp/695/ub_0_
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-d0m10"
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-d0m10, 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-171624189400485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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