Version number: -
Successfully parsed 'input graph': contains 11 nodes and 17 edges
Successfully parsed 'input graph': contains 13144 nodes and 1996782 edges
Successfully parsed 'matching graph': contains 20 matching edges
Using scoring function Edge correctness
Using beta = 1
Computing edge correctness by normalizing with 17
Breaking ties using beta = 0.00490196
Number of primal x variables: 20
Number of primal y variables: 66
Number of dual lambda variables: 33
Number of dual mu variables: 0
Number of subgradients: 33
Initialized dual ascent solver with tau = 1, phi = 0.5 and enhanced = 0
Initialized subgradient solver with k = 20 and l = 10
Initialized combined solver with maxSwitches = 3
i      mu          LB*             UB*              LB              UB             time (s) #subgr+  #subgr-  #dual    
1      1           -1.7976931e+308 1.7976931e+308  *0.59669496     *0.59669496    9.2e-05  1        1        0        
Solved to optimality.